English

On local antimagic chromatic number of cycle-related join graphs

Combinatorics 2020-06-11 v1

Abstract

An edge labeling of a connected graph G=(V,E)G = (V, E) is said to be local antimagic if it is a bijection f:E{1,,E}f:E \to\{1,\ldots ,|E|\} such that for any pair of adjacent vertices xx and yy, f+(x)f+(y)f^+(x)\not= f^+(y), where the induced vertex label f+(x)=f(e)f^+(x)= \sum f(e), with ee ranging over all the edges incident to xx. The local antimagic chromatic number of GG, denoted by χla(G)\chi_{la}(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of GG. In this paper, several sufficient conditions for χla(H)χla(G)\chi_{la}(H)\le \chi_{la}(G) are obtained, where HH is obtained from GG 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.

Keywords

Cite

@article{arxiv.1805.04888,
  title  = {On local antimagic chromatic number of cycle-related join graphs},
  author = {Gee-Choon Lau and Wai-Chee Shiu and Ho-Kuen Ng},
  journal= {arXiv preprint arXiv:1805.04888},
  year   = {2020}
}