H-Supermagic Labeling on Corona Product of Fan and Ladder Graph with a Path

被引：0

作者：

Dewi, R. K. ^{[1
]}

Roswitha, M. ^{[1
]}

Martini, T. S. ^{[1
]}

机构：

[1] Sebelas Maret Univ, Fac Math & Nat Sci FMIPA, Dept Math, Surakarta, Indonesia

来源：

PROCEEDINGS OF THE 3RD INTERNATIONAL SYMPOSIUM ON CURRENT PROGRESS IN MATHEMATICS AND SCIENCES 2017 (ISCPMS2017) | 2018年 / 2023卷

关键词：

H-supermagic labeling; corona; fan; ladder; path;

D O I：

10.1063/1.5064235

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A simple graph G = (V, E) admits an H-covering if every edge in E(G) belongs to a subgraph on G that isomorphics to H. A graph G is H-magic if there exists a bijection function f : V (G) boolean OR E(G) -> {1, 2, ..., vertical bar V (G)vertical bar + vertical bar E(G)vertical bar}, such that for every subgraph H' = (V '(H'); E'(H')) on G satisfied f(H') = Sigma v is an element of V' f(v) + Sigma e is an element of E' f(e) = m(f), where m(f) is a constant magic sum. A graph G is a H -supermagic labeling if f (V) = {1,2, ..., vertical bar V(G)vertical bar} and s(f) is a constant supermagic sum. This research gives the construction of the corona of Fan and Ladder graphs with a path.

引用

页数：5