摘要: |
当G是收缩临界5连通图,x∈V(G)且d(x)≥ 6,x1,x2为与x相邻的5度点时,证明如果x1x2∈E(G),则x与3个5度点相邻. |
关键词: 5连通图 收缩临界 断片 |
DOI: |
投稿时间:2008-06-12 |
基金项目: |
|
The Distribution of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs |
LI Ting-ting
|
(Department of Public Teaching, Guangxi Economic Management Cadres College, Nanning, Guangxi, 530007, China) |
Abstract: |
Let G be a contraction critical 5-connected graph, x∈V (G), d (x) ≥ 6 and x1, x2∈N (x)∩V5(G).If x1x2∈E (G), then there exist 3 vertices of degree 5 in the neighborhood of x. |
Key words: 5-connected graphs contraction critical fragment |