TY - JOUR
T1 - H-supermagic labelings of graphs
AU - Ngurah, A. A.G.
AU - Salman, A. N.M.
AU - Susilowati, L.
N1 - Funding Information:
The first and the second authors were funded by “Hibah Kompetensi Dikti 2009” Research Grant No. 223/SP2H/PP/DP2M/ V/2009, from the Directorate General of Higher Education, Indonesia. The third author was supported by “Hibah PHK A2 Tahun ke-2 Dikti” from the Directorate General of Higher Education, Indonesia.
PY - 2010/4/28
Y1 - 2010/4/28
N2 - 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.
AB - 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.
KW - H-supermagic graph
KW - H-supermagic labeling
UR - http://www.scopus.com/inward/record.url?scp=76049107306&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2009.12.011
DO - 10.1016/j.disc.2009.12.011
M3 - Article
AN - SCOPUS:76049107306
SN - 0012-365X
VL - 310
SP - 1293
EP - 1300
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 8
ER -