| P2r,4m＋2图（r=8,10）的优美性 |
| |
| 引用本文： | 容青.P2r,4m＋2图（r=8,10）的优美性[J].广西师范学院学报(自然科学版),2009,26(2):37-40. |
| |
| 作者姓名： | 容青 |
| |
| 作者单位： | 广西师范学院,物理与电子工程学院,广西,南宁,530023 |
| |
| 基金项目： | 广西教育厅科研项目，广西师范学院青年科研基金项目 |
| |
| 摘 要： | 设u、v是两个固定顶点,用b条内部互不相交且长度皆为a的道路连接u、v所得的图用Pa,b表示.K. M. Kathiresan证实P2r,2m-1(r,m皆为任意正整数)是优美的,且猜想:除了(a,b)=(2r-1,4m-2)外,所有的Pa,b都是优美的.杨元生教授已证实P2r-1,2m-1是优美的,并且证实了当r=1,2,3,4,5,6,7,9时P2r,2m也是优美的.该文证实当r=8,10时P2r,4m+2也是优美的.
|
| 关 键 词： | 优美图 顶点标号 边标号 |
Gracefulness of Graph P_(2r,4m+2)(r=8,10) |
| |
| RONG Qing.Gracefulness of Graph P_(2r,4m+2)(r=8,10)[J].Journal of Guangxi Teachers Education University:Natural Science Edition,2009,26(2):37-40. |
| |
| Authors: | RONG Qing |
| |
| Institution: | College of Physics and Electronic Engineering;Guangxi Teachers Education University;Nanning 530023;China |
| |
| Abstract: | Let u and v be two fixed vertices,connect u and v by means of b internally disjoint paths of length a each,the resulting graphs is denoted by Pa,b.K.M.Kathiresan has shown that P2r,2m-1 is graceful and conjectured that Pa,b is graceful except when(a,b)=(2r-1,4m-2).Prof.YANG Yuansheng has shown that P2r-1,2m-1 and P2r,2m(r=1,2,3,4,5,6,7,9) are graceful.In this paper,P2r,4m+2 is proved to be graceful for r=8,10. |
| |
| Keywords: | graceful graph vertex labeling edge labeling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
