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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.