Open Access
January 2010 On supermagic coverings of fans and ladders
A.A.G. Ngurah, A.N.M. Salman, I W. Sudarsana
Author Affiliations +
SUT J. Math. 46(1): 67-78 (January 2010). DOI: 10.55937/sut/1280430657

Abstract

A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is said to be H-magic if there exists a bijection f:V(G)E(G){1,2,3,,|V(G)E(G)|} such that for every subgraph H of G isomorphic to H, vV(H)f(v)+eE(H)f(e) is constant. Additionally, G is said to be H-supermagic if f(V(G))={1,2,3,,|V(G)|}. In this paper, we study H-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

Download 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

Received: 22 September 2009; Revised: 16 May 2010; Published: January 2010
First available in Project Euclid: 11 June 2022

Digital Object Identifier: 10.55937/sut/1280430657

Subjects:
Primary: 05C78

Keywords: covering , cycle , fan , H-supermagic labeling , ladder

Rights: Copyright © 2010 Tokyo University of Science

Vol.46 • No. 1 • January 2010
Back to Top