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

和轮相关图的优美性
引用本文:王涛,刘海生,李德明.和轮相关图的优美性[J].中山大学学报(自然科学版),2011,50(6).
作者姓名:王涛  刘海生  李德明
作者单位:华北科技学院基础部;首都师范大学数学系;
基金项目:国家自然科学基金资助项目(10201022); 北京市自然科学基金资助项目(1102015); 中央高校基本科研业务费资助项目(2011B019)
摘    要: 证明了对任意自然数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)是优美图。

关 键 词:  优美图  优美标号  非连通图
收稿时间:2011-02-23;

Gracefulness of the Graphs Related to Wheel
WANG Tao,LIU Haisheng,LI Deming.Gracefulness of the Graphs Related to Wheel[J].Acta Scientiarum Naturalium Universitatis Sunyatseni,2011,50(6).
Authors:WANG Tao  LIU Haisheng  LI Deming
Institution:WANG Tao1,LIU Haisheng1,LI Deming2(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)
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.
Keywords:graphs  graceful graphs  graceful labeling  disconnected graph  
本文献已被 CNKI 等数据库收录!
点击此处可从《中山大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《中山大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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