On local antimagic chromatic number of cycle-related join graphs
Combinatorics
2020-06-11 v1
Abstract
An edge labeling of a connected graph is said to be local antimagic if it is a bijection such that for any pair of adjacent vertices and , , where the induced vertex label , with ranging over all the edges incident to . The local antimagic chromatic number of , denoted by , is the minimum number of distinct induced vertex labels over all local antimagic labelings of . In this paper, several sufficient conditions for are obtained, where is obtained from 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}
}