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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 callMore From: AKCE International Journal of Graphs and Combinatorics
Paper Title
Journal
Date
