Abstract
Let H and G be two graphs. The concept of an H-supermagic decomposition of G arises from the marriage between graph labelings and graph decompositions. In this paper, we give the conditions for the existence of C2k-supermagic decomposition of the complete n-partite graph as well as of multiple copies of it.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
