Please use this identifier to cite or link to this item:
Title: On local antimagic chromatic number of spider graphs
Authors: Lau, Gee-Choon
Shiu, Wai-Chee
Soo, Chee-Xian
Keywords: Science::Mathematics
Issue Date: 2022
Source: Lau, G., Shiu, W. & Soo, C. (2022). On local antimagic chromatic number of spider graphs. Journal of Discrete Mathematical Sciences and Cryptography, 1-37.
Journal: Journal of Discrete Mathematical Sciences and Cryptography 
Abstract: An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a Bijection f : E → {1, …,|E|} such that for any pair of adjacent vertices x and y, f +(x) ≠ f +(y), where the induced vertex label f +(x) = Σf(e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by χla (G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. In this paper, we first show that a d-leg spider graph has d + 1 ≤ χla ≤ + 2. We then obtain many sufficient conditions such that both the values are attainable. Finally, we show that each 3-leg spider has χla = 4 if not all legs are of odd length. No 3-leg spider with all odd leg lengths and χla = 5 is found. This provides partial solutions to the characterization of k-pendant trees T with χla (T) = k + 1 or k + 2. We conjecture that almost all d-leg spiders of size q that satisfy d(d + 1) ≤ 2(2q - 1) with each leg length at least 2 has χla = d + 1.
ISSN: 0972-0529
DOI: 10.1080/09720529.2021.1892270
Rights: © 2022 Taru Publications. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SPMS Journal Articles

Page view(s)

Updated on Dec 3, 2022

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.