arXiv Analytics

Sign in

arXiv:1805.04888 [math.CO]AbstractReferencesReviewsResources

On local antimagic chromatic number of cycle-related join graphs

Gee-Choon Lau, Wai-Chee Shiu, Ho-Kuen Ng

Published 2018-05-13Version 1

An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f:E \to\{1,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $\chi_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, several sufficient conditions for $\chi_{la}(H)\le \chi_{la}(G)$ are obtained, where $H$ is obtained from $G$ with a certain edge deleted or added. We then determined the exact value of the local antimagic chromatic number of many cycle related join graphs.

Related articles: Most relevant | Search more
arXiv:2001.05138 [math.CO] (Published 2020-01-15)
On number of pendants in local antimagic chromatic number
arXiv:2008.09754 [math.CO] (Published 2020-08-22)
On Local Antimagic Chromatic Number of Spider Graphs
arXiv:1805.04801 [math.CO] (Published 2018-05-13)
On local antimagic chromatic number of graphs with cut-vertices