TY - JOUR

T1 - On the construction of super edge-magic total graphs

AU - Darmaji,

AU - Wahyudi, S.

AU - Rinurwati,

AU - Saputro, S. W.

N1 - Publisher Copyright:
© 2022. All Rights Reserved.

PY - 2022

Y1 - 2022

N2 - Suppose G = (V,E) be a simple graph with p vertices and q edges. An edge-magic total labeling of G is a bijection f: V U E {1, 2,…, p + q} where there exists a constant r for every edge xy in G such that f(x) + f(y) + f(xy) = r. An edge-magic total labeling f is called a super edge-magic total labeling if for every vertex v (Formula presented) V(G), f (v) < p. The super edge-magic total graph is a graph which admits a super edge-magic total labeling. In this paper, we consider some families of super edge-magic total graph G. We construct several graphs from G by adding some vertices and edges such that the new graphs are also super edge-magic total graphs.

AB - Suppose G = (V,E) be a simple graph with p vertices and q edges. An edge-magic total labeling of G is a bijection f: V U E {1, 2,…, p + q} where there exists a constant r for every edge xy in G such that f(x) + f(y) + f(xy) = r. An edge-magic total labeling f is called a super edge-magic total labeling if for every vertex v (Formula presented) V(G), f (v) < p. The super edge-magic total graph is a graph which admits a super edge-magic total labeling. In this paper, we consider some families of super edge-magic total graph G. We construct several graphs from G by adding some vertices and edges such that the new graphs are also super edge-magic total graphs.

KW - edge-magic total labeling

KW - super edge-magic total graph

KW - super edge-magic total labeling

UR - http://www.scopus.com/inward/record.url?scp=85131039503&partnerID=8YFLogxK

U2 - 10.5614/ejgta.2022.10.1.21

DO - 10.5614/ejgta.2022.10.1.21

M3 - Article

AN - SCOPUS:85131039503

SN - 2338-2287

VL - 10

SP - 301

EP - 309

JO - Electronic Journal of Graph Theory and Applications

JF - Electronic Journal of Graph Theory and Applications

IS - 1

ER -