On cycle-supermagic labelings of the disconnected graphs
Syed Tahir Raza Rizvi, Kashif Ali
TL;DR
This paper introduces the concept of cycle-supermagic labelings for disconnected graphs, specifically focusing on disjoint unions of isomorphic and non-isomorphic graphs like fans and ladders, expanding the theory in graph labelings.
Contribution
It formulates cycle-supermagic labelings for disconnected graphs and proves such labelings exist for unions of fans and ladders, including non-isomorphic cases.
Findings
Disjoint unions of isomorphic graphs are cycle-supermagic.
Disjoint unions of non-isomorphic fans and ladders are cycle-supermagic.
The paper extends cycle-supermagic labelings to new classes of disconnected graphs.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems