On cycle-supermagic labelings of the disconnected graphs
Combinatorics
2016-10-31 v1
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.
Keywords
Cite
@article{arxiv.1506.06087,
title = {On cycle-supermagic labelings of the disconnected graphs},
author = {Syed Tahir Raza Rizvi and Kashif Ali},
journal= {arXiv preprint arXiv:1506.06087},
year = {2016}
}