Complete characterization of s-bridge graphs with local antimagic chromatic number 2
Combinatorics
2022-10-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, we characterize -bridge graphs with local antimagic chromatic number 2.
Keywords
Cite
@article{arxiv.2210.04394,
title = {Complete characterization of s-bridge graphs with local antimagic chromatic number 2},
author = {Gee-Choon Lau and Wai-Chee Shiu and Ruixue Zhang and K. Premalatha and M. Nalliah},
journal= {arXiv preprint arXiv:2210.04394},
year = {2022}
}