| 3-连通3-正则图生成树外的可去边 |
| |
| 引用本文： | 吴吉昌,李学良.3-连通3-正则图生成树外的可去边[J].数学研究,2003,36(3):223-229. |
| |
| 作者姓名： | 吴吉昌 李学良 |
| |
| 作者单位： | 1. 西北工业大学计算机科学与工程系,陕西,西安,710072
2. 南开大学组合数学研究中心,天津,300071 |
| |
| 基金项目： | Research supported by National Science Foundation of China |
| |
| 摘 要： | G是3-连通图，e是G中的一条边．若G-e是3-连通图的一个剖分，则称e是3-连通图的可去边．否则，e是G中不可去边．本给出3-连通3-正则图中生成树外可去边的分布情况及数目．
|
| 关 键 词： | 3连通3正则图 可去边 边点割断片 分布 |
Removable Edges Outside a Spanning Tree of a 3-Connected 3-Regular Graph |
| |
| Wu Jichang,Li Xueliang.Removable Edges Outside a Spanning Tree of a 3-Connected 3-Regular Graph[J].Journal of Mathematical Study,2003,36(3):223-229. |
| |
| Authors: | Wu Jichang Li Xueliang |
| |
| Abstract: | Let G be a 3-connected graph and e an cdge of G. If, by deleting e from G the resultant graph G -e is a subdivision of a 3-connected graph, then e is called a removable edge of G. In this paper we study the problem on at least how many removable edges there are outside a spanning tree of a 3-connccted 3-regular graph. |
| |
| Keywords: | 3-Connccted 3-regular graph Removable edge Edge-vertex-cut fragment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
