English

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 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, we characterize ss-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}
}