H-Supermagic Labeling on Shrubs Graph and Lm ? Pn

International Conference on Mathematics: Education, Theory and Application

数学;教育

Ulfatimah, Risala^1 ; Roswitha, Mania^1 ; Kusmayadi, Tri Atmojo^1

Department of Mathematics, Faculty of Mathematics and Natural Sciences, Sebelas Maret University, Surakarta

57126, Indonesia^1

关键词: Bijections;    Graph G;    Subgraphs;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/855/1/012055/pdf
DOI  :  10.1088/1742-6596/855/1/012055

学科分类：发展心理学和教育心理学

来源: IOP

【 摘 要 】

A nite simple graph G admits an H-covering if every edge of E(G) belongs to a subgraph of G isomorphic to H. We said the graph G = (V, E) that admits H-covering to be H-magic if there exists a bijection function f : V(G) ∪ E(G) → {1, 2, , |V(G)| + |E(G)|} such that for each subgraph H′ of G isomorphic to H, f(H′) = ∑υ∈V′f(υ) + ∑e∈E′f(e) = m(f) is constant. Furthermore, if f(V) = 1, 2, , |V(G)| then G is called H-supermagic. In this research we de ned S2,2-supermagic labeling on shrub graph Š(m1, m2, , mn) and fish-supermagic labeling on Lmo Pnfor m, n ≥ 2.