We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Edge-magic Total Labeling Algorithm of Unicyclic Graphs.
- Authors
Bimei Wang; Jingwen Li
- Abstract
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.
- Subjects
GRAPH labelings; GRAPH algorithms; BIJECTIONS; ALGORITHMS
- Publication
IAENG International Journal of Applied Mathematics, 2021, Vol 51, Issue 4, p920
- ISSN
1992-9978
- Publication type
Article