| 3连通图生成树上的可去边 |
| |
| 引用本文： | 吴吉昌,李学良.3连通图生成树上的可去边[J].兰州大学学报(自然科学版),2003,39(6):8-11. |
| |
| 作者姓名： | 吴吉昌 李学良 |
| |
| 作者单位： | 1. 西北工业大学,计算机科学与工程系,陕西,西安,710072
2. 南开大学,组合数学研究中心,天津,300071 |
| |
| 基金项目： | 国家自然科学基金资助项目(2000CG0103). |
| |
| 摘 要： | 摘要：设G是3连通图，e是G中的一条边．若G—e是3连通图的一个剖分．则称e是3连通图G的可去边．否则，称e是G的不可去边．本文给出某些3连通图的生成树上可去边的分布情况及数目。
|
| 关 键 词： | 3连通图 生成树 可去边 |
| 文章编号： | 0455-2059(2003)06-0008-04 |
Removable edges in a spanning tree of a 3-connected graph |
| |
| WU Ji-chang ,LI Xue-liang.Removable edges in a spanning tree of a 3-connected graph[J].Journal of Lanzhou University(Natural Science),2003,39(6):8-11. |
| |
| Authors: | WU Ji-chang LI Xue-liang |
| |
| Institution: | WU Ji-chang 1,LI Xue-liang 2 |
| |
| Abstract: | An edge of a 3-connected graph G is said to be removable if G-e is a subdivision of a 3-connected graph.In this paper,we obtain the following two results:if G is a 3-connected graph of minimal degree at least four,then every spanning tree of G contains at least two removable edges of G.If G is a 3-connected graph of girth at least four,then every spanning tree of G contains at least two removable edges of G. |
| |
| Keywords: | connected graph spanning tree removable edge |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
