| 每点都与3度点相邻的最大临界3棱连通图的结构 |
| |
| 引用本文： | 徐俊明.每点都与3度点相邻的最大临界3棱连通图的结构[J].中国科学技术大学学报,1987(4). |
| |
| 作者姓名： | 徐俊明 |
| |
| 作者单位： | 中国科学技术大学数学系 |
| |
| 摘 要： | 没G=(V,E)是3棱连通图,若对每个x∈V(G),G-x 不是3棱连通的,则称G 为临界3棱连通图.p 阶临界3棱连通图的全体记为(?)_3(p),G∈(?)_3(p)称为最大的,如果不存在H∈(?)_3(p),使|E(H)|>|E(G)|.本文给出每个点都与3度点相邻的p 阶最大临界3棱连通图的结构.
|
| 关 键 词： | 3棱连通度 临界3棱连通图 极值图 |
The Censtructions of Maximum Critically 3-Edge-Connected Graphs with Every Vertex Adjoining the Vertex of Degree Three |
| |
| Xu Jumning.The Censtructions of Maximum Critically 3-Edge-Connected Graphs with Every Vertex Adjoining the Vertex of Degree Three[J].Journal of University of Science and Technology of China,1987(4). |
| |
| Authors: | Xu Jumning |
| |
| Institution: | Department of Mathematics |
| |
| Abstract: | A graph G is called to be critically 3-edge-connected if G is 3-edge-connected and deleting any arbitrarily chosen vertex from G always leaves agraph which is not 3-edge-connected.A critically 3-edge-connected graph G oforder p is called to be maximum if it has the greatest size among all suchgraphs of the same order as G.The constructions of maximum critically 3-edge-connected graphs withevery vertex adjoining the vertex of degree three are given in this paper. |
| |
| Keywords: | 3-edge-connectivity critically 3-edge-connected graph extremal graphs |
| 本文献已被 CNKI 等数据库收录！ |
