中山大学学报自然科学版 ›› 2011, Vol. 50 ›› Issue (6): 16-19.

• 研究论文 • 上一篇    下一篇

和轮相关图的优美性

王 涛1,刘海生1,李德明2   

  1. (1.华北科技学院基础部,河北 三河 065201;2.首都师范大学数学系,北京 100048)
  • 收稿日期:2011-02-23 修回日期:1900-01-01 出版日期:2011-11-25 发布日期:2011-11-25

Gracefulness of the Graphs Related to Wheel

WANG Tao1,LIU Haisheng1,LI Deming2   

  1. (1.Department of Basic Course, North China Institute of Science and Technology, Sanhe 065201, China;2.Department of Mathematics, Capital Normal University,Beijing 100048, China)
  • Received:2011-02-23 Revised:1900-01-01 Online:2011-11-25 Published:2011-11-25

摘要: 证明了对任意自然数n≥1,p≥1,当m=2p+3,2p+4时,非连通图Wm∪Kn,p和Wm,2m+1∪Kn,p是优美图;当i=1,2时,图W2p+2+i∪G(i)p是优美图。当m≥3,n≥s时,Wm,2m+1∪St(n)是优美图;当m=2n+5时,图Wm,2m+1∪(C3∨Kn)是优美图。

关键词: 图, 优美图, 优美标号, 非连通图

Abstract: For any natural numbers n,p, which are not less than one, when m=2p+3 or 2p+4, the disconnected graphs Wm∪Kn,pand Wm,2m+1∪Kn,p are graceful; when i=1 or 2, the graph W2p+2+i∪G(i)p is graceful. If m is greater than or equal to three, and n is greater than or equal to s, where s is a natural number, Wm,2m+1∪St(n) is graceful; in particular, if m=2n+5, Wm,2m+1∪(C3∨Kn) is graceful.

Key words: graphs, graceful graphs, graceful labeling, disconnected graph

中图分类号: