On cycle-supermagic labelings of the disconnected graphs
classification
🧮 math.CO
keywords
cycle-supermagiccopiesdisjointgraphsisomorphiclabelingsuniondifferent
read the original abstract
In this paper we formulate cycle-supermagic labelings for the disjoint union of isomorphic copies of different families of graphs. We also prove that disjoint union of non isomorphic copies of fans and ladders are cycle-supermagic.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.