Abstract
An edge labeling of a connected graph [Formula: see text] is said to be local antimagic if it is a bijection [Formula: see text] such that for any pair of adjacent vertices x and y, [Formula: see text], where the induced vertex label [Formula: see text], with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by [Formula: see text], is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. In this paper, we show the existence of infinitely many bipartite and tripartite graphs with [Formula: see text].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
