节点文献
连通图的极小键覆盖
Covering a connected graph with bonds of minimum total size
【摘要】 对连通图的键覆盖进行了研究。通过讨论图的键覆盖的存在性 ,估计了其键覆盖大小 ,证明了图的键覆盖大小等于它的边割覆盖大小。
【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.
- 【文献出处】 北京化工大学学报(自然科学版) ,Journal of Beijing University of Chemical Technology , 编辑部邮箱 ,2003年04期
- 【分类号】O157.5
- 【下载频次】68