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

几类并图的优美标号
引用本文:魏丽侠,张昆龙. 几类并图的优美标号[J]. 中山大学学报(自然科学版), 2008, 47(3): 10-13
作者姓名:魏丽侠  张昆龙
作者单位:华北科技学院,基础部,河北,三河,065200
摘    要: 对非连通并图的优美性进行了研究,给出了几类非连通的并图,得出了如下结果:对任意的正整数n,m,设s是不超过n/2的最大整数,Pn是n个顶点的路,St(m)是m+1个顶点的星形树,路P2的补图与路Pn的联图记为An,则当n≥2时,A2n与任意一个具有n-1条边的优美图的并图是一个优美图;当n≥5,m≥s+2时,An与星形树St(m)的并图是一个优美图,从而An与星形树St(n)的并图是一个优美图;当n≥5时,An与任意一条路Pn的并图是一个(n-s)-优美图。

关 键 词:  优美图  优美标号  非连通图
文章编号:0529-6579(2008)03-0010-04
收稿时间:2007-09-27;
修稿时间:2007-09-27

The Graceful Graphs on Several Kinds of Union Graphs
WEI Li-xia,ZHANG Kun-long. The Graceful Graphs on Several Kinds of Union Graphs[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2008, 47(3): 10-13
Authors:WEI Li-xia  ZHANG Kun-long
Affiliation:(North China Institute of Science and Technology,Hebei Sanhe 065200,China)
Abstract:To study the gracefulness of unconnected union graphs,several kinds of unconnected union graphs are given and the following results are obtainedfor arbitrary positive integer n,m,let 's be the greatest integer not greater than n/2,Pn be a path with n vertex,St(m)be a star tree with m+1 vertex,graph An be the join graph of complement of P2 and Pn ,then for n≥2,the union of A2n and arbitrary a graceful graph with n-1 edges is a graceful graph;for n≥5,m≥s+2,the union of An and star tree St(m) is a graceful graph,therefore the union of An and star tree St(n) is a graceful grap;for n≥5,the union of An and arbitrary path Pn is a (n-s) graceful graph.
Keywords:graph  graceful graph  graceful label  unconnected graph
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《中山大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《中山大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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