2022/10/10 by Gee-Choon Lau, Wai Chee Shiu, Lau, Gee-Choon +7
Computer Science · #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2210.04394
An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f:E →\1,… ,|E|\ such that for any pair of adjacent vertices x and y, f+(x)\not= f+(y), where the induced vertex label f+(x)= ∑ f(e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by χla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. In this paper, we characterize s-bridge graphs with local antimagic chromatic number 2.