首页 | 本学科首页   官方微博 | 高级检索  
     

On the Gracefulness of Graph(jC_(4n))∪P_m
作者姓名:ZHANG ZHI-SHANG  ZHANG QING-CHENG  WANG CHUN-YUE
作者单位:[1]School of Applied Sciences, Jilin Teachers institute of Engineering and Technology, Changchun, 130052 [2]School of Mathematics and Statistics, Northeast Normal University, Changchun, 130032
摘    要:The present paper deals with the gracefulness of unconnected graph (jC_(4n))∪P_m,and proves the following result:for positive integers n,j and m with n≥1,j≥2,the unconnected graph(jC_(4n))∪P_m is a graceful graph for m=j-1 or m≥n+j,where C_(4n) is a cycle with 4n vertexes,P_m is a path with m+1 vertexes,and(jC_(4n))∪P_m denotes the disjoint union of j-C_(4n) and P_m.

关 键 词:新泽西州  连接图  正整数  优美图  不相交  顶点  周期
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号