Gracefulness of Two Kinds of Unconnected Graphs with Even Vertices  

作　　者：WEN Xiaoyan WANG Tao SUI Lili 

机构地区：[1]College of Science,North China Institute of Science and Technology,Sanhe 065201,Hebei,China

出　　处：《Wuhan University Journal of Natural Sciences》2022年第3期185-188,共4页武汉大学学报（自然科学英文版）

基　　金：the National Natural Science Foundation of China(11702094);the Fundamental Research Funds for the Central University(3142015045)。

摘　　要：Two kinds of unconnected double fan graphs with even vertices,(P^((1))_(1)∨(P^((1))_(2n)∪P^((2))_(2n)))∪P_(2n+1)∪(P_(1)^((2))∨K_(2n))and(P_(1)^((1))∨(P^((1))_(2n)∪P^((2))_(2n)))∪(P_(1)^((2))∨K_((1))^(2n))∪(P^((3))_(1)∨K_((2))^(2n))were presented.For natural number n∈N,n≥1,the two graphs are all graceful graphs,where P^((1))_(2n),P^((2))_(2n)are even-vertices path,P_(2n+1)is odd-vertices path,K_(2n),K^((1))_(2n),K^((2))_(2n)are the complement of graph K_(2 n),G_(1)∨G_(2)is the join graph of G_(1)and G_(2).

关 键 词：unconnected graph double fan graph graceful graph graceful label even vertices 

分 类 号：O157.5[理学—数学]