| K-优美图与优美图Gk-1的优美性研究 |
| |
| 引用本文： | 于艳华,王文祥,张昆龙.K-优美图与优美图Gk-1的优美性研究[J].西南师范大学学报(自然科学版),2012,37(5):1-5. |
| |
| 作者姓名： | 于艳华 王文祥 张昆龙 |
| |
| 作者单位： | 华北科技学院基础部,河北三河,065201 |
| |
| 基金项目： | 国家自然科学基金资助项目(19801016,10261003) |
| |
| 摘 要： | 对k-优美图n,Km,n与任意一个有k-1条边的优美图Gk-1的优美关系进行了研究.证明了:当n为奇数时,图n∪Gk-1是优美图;当n为偶数时,粘接图〈n,Gk-1〉是优美图.还证明了粘接图〈Km,n,Gk-1〉是优美图.
|
| 关 键 词： | 图 优美图 优美标号 非连通图 |
On Gracefulness of k-Graceful Graph and Gk-1-Co-Graphs |
| |
| YU Yan-hua
,
WANG Wen-xiang
,
ZHANG Kun-long.On Gracefulness of k-Graceful Graph and Gk-1-Co-Graphs[J].Journal of Southwest China Normal University(Natural Science),2012,37(5):1-5. |
| |
| Authors: | YU Yan-hua WANG Wen-xiang ZHANG Kun-long |
| |
| Institution: | Department of Basic Curriculum,North China Institute of Science & Technology,Sanhe Hebei 065201,China |
| |
| Abstract: | A study has been done in this thesis on the gracefulness of k-graceful graph n,K m,n and a randomly chosen graceful graph G k-1 with any k-1sides.The study proves that n ∪G k-1 is a graceful graph when nis an odd number;and that adhesive figure〈n,G k-1 〉is a graceful graph when nis an even num-ber.This study also demonstrates that〈 K m,n,G k-1 〉is graceful. |
| |
| Keywords: | graph graceful graph graceful label unconnected graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《西南师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《西南师范大学学报(自然科学版)》下载免费的PDF全文 |
|
