Back to Search
Start Over
Edge-magic Total Labeling Algorithm of Unicyclic Graphs.
- Source :
-
IAENG International Journal of Applied Mathematics . Dec2021, Vol. 51 Issue 4, p920-929. 10p. - Publication Year :
- 2021
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH labelings
*GRAPH algorithms
*BIJECTIONS
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 19929978
- Volume :
- 51
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- IAENG International Journal of Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 153970461