On Local Antimagic Chromatic Number of Spider Graphs

MaRDI QIDQ6347533zbMATH OpenFDO

Authors Gee-Choon Lau, Wai Chee Shiu, Chee-Xian Soo

Publication date 22 August 2020

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: An edge labeling of a connected graph $G=(V,E)$ is said to be local antimagic if it is a bijection $f:Eo1,\mathrm{...},|E|$ such that for any pair of adjacent vertices $x$ and $y$, $f^{+}(x)e{f}^{+}(y)$, where the induced vertex label $f^{+}(x)=sumf(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $ch{i}_{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+1lech{i}_{la}led+2$. We then obtain many sufficient conditions such that both the values are attainable. Finally, we show that each 3-leg spider has $ch{i}_{la}=4$ if not all legs are of odd length. We conjecture that almost all $d$-leg spiders of size $q$ that satisfies $d(d+1)le2(2q-1)$ with each leg length at least 2 has $ch{i}_{la}=d+1$.

This page was built for publication: On Local Antimagic Chromatic Number of Spider Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347533)