| 连通图的极小键覆盖 |
| |
| 引用本文： | 郭秋敏.连通图的极小键覆盖[J].北京化工大学学报(自然科学版),2003,30(4):102-104. |
| |
| 作者姓名： | 郭秋敏 |
| |
| 作者单位： | 北京化工大学理学院,北京,100029 |
| |
| 摘 要： | 对连通图的键覆盖进行了研究。通过讨论图的键覆盖的存在性，估计了其键覆盖大小，证明了图的键覆盖大小等于它的边割覆盖大小。
|
| 关 键 词： | 图 极小覆盖 边割 键 图 极小覆盖 边割 键 |
| 修稿时间： | 2002年11月21日 |
Covering a connected graph with bonds of minimum total size |
| |
| GUO Qiu-min.Covering a connected graph with bonds of minimum total size[J].Journal of Beijing University of Chemical Technology,2003,30(4):102-104. |
| |
| Authors: | GUO Qiu-min |
| |
| Institution: | College of Science; Beijing University of Chemical Technology; Beijing; China |
| |
| Abstract: | In this paper, the bond cover of a connected graph was studied. At first, it discussed the existence of the bond cover, and then gave an estimate to its bond cover size. As the main result, it was proved that the bond cover size of a connected graph equals to its cut cover size. |
| |
| Keywords: | graph minimum cover cut bond |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京化工大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《北京化工大学学报(自然科学版)》下载免费的PDF全文 |
