Abstract
A simple graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . The graph is said to be -magic if there exists a bijection such that for every subgraph of isomorphic to , is constant. Additionally, is said to be -supermagic if . In this paper, we study -supermagic labelings of two classes of connected graph namely fans and ladders.
Acknowledgement
The authors are thankful to the anonymous referee for some comments that helped to improve the presentation of the manuscript. The first and the second authors were funded by “Hibah Kompetensi” from the Directorate General of Higher Education of Indonesia. The third author was supported by “Insentif Riset Dasar” from the State Ministry of Research and Technology of Indonesia.
Citation
A.A.G. Ngurah. A.N.M. Salman. I W. Sudarsana. "On supermagic coverings of fans and ladders." SUT J. Math. 46 (1) 67 - 78, January 2010. https://doi.org/10.55937/sut/1280430657
Information