| 几类乘积图的圈覆盖 |
| |
| 引用本文： | 江莹茵,李剑敏,罗由学.几类乘积图的圈覆盖[J].福州大学学报(自然科学版),1995(1):8-14. |
| |
| 作者姓名： | 江莹茵 李剑敏 罗由学 |
| |
| 作者单位： | 福州大学数学系 |
| |
| 摘 要： | 文献［１］提出猜想：每个２─连通ｎ阶简单图都有一个圈覆盖Ｃ，使得｜ｃ｜≤（２ｎ－１）／３。此猜想至今尚未完全证实。本文对路、圈、完全图的若干笛卡尔乘积图和张量乘积图证实了猜想是正确的。
|
| 关 键 词： | 乘积图 圈覆盖 图论 |
The Cycle Cover of Some of the Product Graphs |
| |
| Jiang Yingyin,Li Jianmin,Luo Youxue.The Cycle Cover of Some of the Product Graphs[J].Journal of Fuzhou University(Natural Science Edition),1995(1):8-14. |
| |
| Authors: | Jiang Yingyin Li Jianmin Luo Youxue |
| |
| Institution: | Jiang Yingyin;Li Jianmin;Luo Youxue;(Department of Mathematics,Fuzhou University,Fuzhou,350002) |
| |
| Abstract: | The conjecture proposed by Bondy J A,that every 2-connected simple graph G on n vertices admits a collection C of a cycle of G in such a way that |C|<(2n-l) / 3, has not been fully confirmed so far. In this paper,this conjecture is confirmed by a number of cartesion product graphs and tensor product graphs on path, cycle and complete graphs. |
| |
| Keywords: | product graph cycle cover graph theory |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
