| 关于联图P_1VP_n的k-强优美性 |
| |
| 引用本文： | 陈淑贞,周俊梅.关于联图P_1VP_n的k-强优美性[J].数学杂志,2010,30(2). |
| |
| 作者姓名： | 陈淑贞 周俊梅 |
| |
| 作者单位： | 海南师范大学数学与统计学院,海南,海口,571158 |
| |
| 基金项目： | 海南省教育厅科研基金，海南师范大学青年教师科研基金 |
| |
| 摘 要： | 本文研究了联图P_1VP_n的k-强优美性问题.利用K-强优美图的定义,获得了联图P_1VP_n是k-强优美图的必要条件,还得到了当n:2k-1时联图P_1VP_n是k-强优美图,亦是k-优美图,及当n≥3时联图P_1VP_n是2-强优美图,也是2-优美图的结果,推广了联图P_1VP_n是优美图的结果.
|
| 关 键 词： | 联图 优美标号 k-强优荚图 k-优美图 |
k-STRONG GRACEFULNESS OF JOIN GRAPH P_1VP_n |
| |
| CHEN Shu-zhen,ZHOU Jun-mei.k-STRONG GRACEFULNESS OF JOIN GRAPH P_1VP_n[J].Journal of Mathematics,2010,30(2). |
| |
| Authors: | CHEN Shu-zhen ZHOU Jun-mei |
| |
| Institution: | CHEN Shu-zhen,ZHOU Jun-mei(School of Mathematics , Statistics,Hainan Normal University,Haikou 571158,China) |
| |
| Abstract: | In this article, we study the k-strong gracefulness for join graph P_1VP_n. By using the definition of k-strong graceful graph, we obtain the necessary conditions for a join graph P_1VP_n to be an k-strong graceful graph. It is proved that, for n=2k-1, a join graph P_1VP_n is an k-strong graceful graph and is also k graceful graph, and for n≥3, a join graph P_1VP_n is a 2-strong graceful graph and also a 2-graceful graph. These extend the result of a join graph P1VPn to be a graceful graph. |
| |
| Keywords: | join graph graceful label k-strong graceful graph k-graceful graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
