H-supermagic labelings of graphs

A. A.G. Ngurah, A. N.M. Salman, L. Susilowati

Research output: Contribution to journalArticlepeer-review

78 Citations (Scopus)


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, ∑v ∈ V (H′) f (v) + ∑e ∈ E (H′) f (e) is constant. G is said to be H-supermagic if f (V (G)) = {1, 2, 3, ..., | V (G) |}. In this paper, we study cycle-supermagic labelings of chain graphs, fans, triangle ladders, graphs obtained by joining a star K1, n with one isolated vertex, grids, and books. Also, we study Pt-(super)magic labelings of cycles.

Original languageEnglish
Pages (from-to)1293-1300
Number of pages8
JournalDiscrete Mathematics
Issue number8
Publication statusPublished - 28 Apr 2010


  • H-supermagic graph
  • H-supermagic labeling


Dive into the research topics of 'H-supermagic labelings of graphs'. Together they form a unique fingerprint.

Cite this