Super edge-magic labeling of graphs: deficiency and maximality

Ngurah, Anak Agung Gede; Simanjuntak, Rinovia

doi:10.5614/ejgta.2017.5.2.5

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2024

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sugeng and Silaban provide bedge consecutive edge magic total labeling for some classes of regular trees [12] and disconnected graphs [10]. For graphs that don't admit SEMTL, Ngurah and Simanjuntak [7,8] add isolated vertices such that the graph admits SEMTL. The number of isolated vertices added is called the super edge magic deficiency.…”

Section: Introductionmentioning

confidence: 99%

On b-edge consecutive edge magic total labeling on trees

Setiawan

Sugeng

Silaban

2022

EJGTA

View full text Add to dashboard Cite

Let G = (V, E) be a simple, connected, and undirected graph, where V and E are the set of vertices and the set of edges of G. An edge magic total labeling on G is a bijection f :Such a labeling is said to be a super edge magic total labeling if f (V ) = {1, 2, . . . , |V |} and a b-edge consecutive edge magic total labeling if f (E) = {b + 1, b + 2, . . . , b + |E|} with b ≥ 1.In this research, we give sufficient conditions for a graph G having a super edge magic total labeling to have a b-edge consecutive edge magic total labeling. We also give several classes of connected graphs which have both labelings.

show abstract

Section: Introductionmentioning

confidence: 99%