%A WANG Bi-mei, LI Jing-wen, GU Yan-bo, SHAO Shu-hong
%T Edge-magic total labeling of unicyclic graphs
%0 Journal Article
%D 2020
%J JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
%R 10.6040/j.issn.1671-9352.0.2019.439
%P 42-50
%V 55
%N 9
%U {http://lxbwk.njournal.sdu.edu.cn/CN/abstract/article_3331.shtml}
%8
%X An edge-magic total labeling is a one-to-one mapping *f* from *V(G)∪E(G)* onto *{*1*,*2*,…,p+q}* such that there exists a constant *K* satisfying *f(u)+f(v)+f(uv)=K,* for each *uv∈E(G)*. A graph *G(p,q)* which has a edge-magic total labeling can be called edge-magic total labeling graph. An algorithm to label the unicyclic graphs with less than 16 vertices is designed. The rules of two special unicyclic graphs are obtained, and *C*_{n}SymbolQC@S_{m} and *C*_{n}Δ*S*_{m} to describe the two types of graphs are defiened, and related theorems are given and proved. The results show that all the unicyclic graphs with less than or equal to 16 vertices have a edge-magic total labeling, and most of them are super edge-magic total labeling. Therefore, it is speculated that the unicyclic graphs with more than 16 vertices also have the same characters.