Complete characterization of bridge graphs with local antimagic chromatic number 2
- 25 September 2024
- journal article
- research article
- Published by Udmurt State University in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
- Vol. 34 (3) , 375-396
Abstract
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f\colon E \to\{1,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $\chi_{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.
Keywords
All Related Versions
This publication has 1 reference indexed in Scilit:
- Local Antimagic Vertex Coloring of a GraphGraphs and Combinatorics, 2017