Edge-magic Total Labeling Algorithm of Unicyclic Graphs

A graph G(p, q) is said to have an edge-magic total labeling if there exists a bijective function f: V(G) ∪ E (G)→ {1,2, ...,p + q}, such that for any edge uv∈E(G) the condition f(u) + f(v) + f(uv) = k is satisfied, k is a constant. In this paper, a new algorithm, based on the graph generate algorit...

Full description

Saved in:
Bibliographic Details
Published inIAENG international journal of applied mathematics Vol. 51; no. 4; pp. 1 - 10
Main Authors Wang, Bimei, Li, Jingwen
Format Journal Article
LanguageEnglish
Published Hong Kong International Association of Engineers 01.12.2021
Subjects
Algorithms
Graphs
Labeling
Online AccessGet full text
ISSN1992-9978
1992-9986

Cover

More Information
Summary:A graph G(p, q) is said to have an edge-magic total labeling if there exists a bijective function f: V(G) ∪ E (G)→ {1,2, ...,p + q}, such that for any edge uv∈E(G) the condition f(u) + f(v) + f(uv) = k is satisfied, k is a constant. In this paper, a new algorithm, based on the graph generate algorithm, is designed to obtain the edge-magic total labeling of the unicyclic graphs. Some theorems about unicyclic graphs are also deduced from the algorithm's results. It's believed that the algorithm proposed is innovative and can be adopted by other researchers.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1992-9978
1992-9986