Abstract
An edge labeling of a 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 [Formula: see text] and [Formula: see text], [Formula: see text], where the induced vertex label of [Formula: see text] is [Formula: see text] ([Formula: see text] is the set of edges incident to [Formula: see text]). The local antimagic chromatic number of [Formula: see text], denoted by [Formula: see text], is the minimum number of distinct induced vertex labels over all local antimagic labelings of [Formula: see text]. In this paper, several sufficient conditions to determine the local antimagic chromatic number of the join of graphs are obtained. We then determine the exact value of the local antimagic chromatic number of many join graphs.
Sign-in/Register to access full text options 
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.
