Abstract
For positive integer [Formula: see text], a graph [Formula: see text] is said to be [Formula: see text]-magic if the edges of [Formula: see text] can be labeled with the nonzero elements of Abelian group [Formula: see text], where [Formula: see text] (the set of integers) and [Formula: see text] is the group of integers mod [Formula: see text], so that the sum of the labels of the edges incident to any vertex of [Formula: see text] is the same. When this constant sum is [Formula: see text], we say that [Formula: see text] is a zero-sum [Formula: see text]-magic graph. The set of all [Formula: see text] for which [Formula: see text] is a zero-sum [Formula: see text]-magic graph is the null set of [Formula: see text]. In this paper, we will completely determine the null set of the join of a finite number of paths.
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.
