Abstract
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we deal with special supermagic labelings of regular graphs and their using to construction of supermagic labelings of disconnected graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have