Gracefulness of Several Unconnected Graphs with Wheel  

作　　者：WEI Jing WANG Tao SUN Caiyun 

机构地区：[1]Department of Basic Course, North China Institute of Science and Technology

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

基　　金：Supported by the Natural Science Foundation of Beijing(1102015);University Scientific Research Project of Hebei Province(Z2014032);the Fundamental Research Funds for the Central Universities(HKXJZD201402,2011B019,3142013025,3142014127)

摘　　要：In the paper, we study the gracefulness of several unconnected graphs related to wheel. For natural number p ≥ 1, t ≥ 1 , let n = 2t ＋ 3,2t ＋ 4 , which proved W. U K （1） p,t U K（2） is graceful; for p≥1, t≥1 ,let n=2t＋3,2t＋4, then Wn,2n＋1 U K（1）p,t U K（2） p,t is graceful and for m ≥ 1, r ≥ 1 , let n = 2m ＋ 5, Wn,2n＋1 U （C3 v Km） U St（r） is graceful.In the paper, we study the gracefulness of several unconnected graphs related to wheel. For natural number p ≥ 1, t ≥ 1 , let n = 2t ＋ 3,2t ＋ 4 , which proved W. U K （1） p,t U K（2） is graceful; for p≥1, t≥1 ,let n=2t＋3,2t＋4, then Wn,2n＋1 U K（1）p,t U K（2） p,t is graceful and for m ≥ 1, r ≥ 1 , let n = 2m ＋ 5, Wn,2n＋1 U （C3 v Km） U St（r） is graceful.

关 键 词：WHEEL unconnected graph graceful graphs gracefullabeling 

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