| 超连通图的充分条件 |
| |
| 引用本文： | 郭利涛.超连通图的充分条件[J].浙江大学学报(理学版),2018,45(4):391-393. |
| |
| 作者姓名： | 郭利涛 |
| |
| 作者单位： | 厦门理工学院 应用数学学院, 福建 厦门 361024 |
| |
| 基金项目： | Supported by NSFC(11301440). |
| |
| 摘 要： |
|
| 关 键 词： | 连通度 逆度 超连通 |
| 收稿时间： | 2017-07-31 |
Sufficient conditions for graphs to be super connected |
| |
| GUO Litao.Sufficient conditions for graphs to be super connected[J].Journal of Zhejiang University(Sciences Edition),2018,45(4):391-393. |
| |
| Authors: | GUO Litao |
| |
| Affiliation: | School of Applied Mathematics, Xiamen University of Technology, Xiamen 361024, Fujian Province, China |
| |
| Abstract: | Let G be a connected graph. The connectivity κ(G) of a connected graph G is the least positive integer k such that there is F⊂V,|F|=k, and G-F is disconnected or is a trivial graph. If every minimum vertex cut isolates a vertex of G, a graph G is super connected or super-κ. Define the inverse degree of a graph G with no isolated vertices as R(G)= 1/(d(v)). In this paper, we show that let G be a connected graph with order n and minimum degree δ, if R(G)<1+2/(δ+1)+(n-2δ-1)/((n-1)(n-3)), then G is super-κ. |
| |
| Keywords: | connectivity inverse degree super connected |
|
| 点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息 |
|
点击此处可从《浙江大学学报(理学版)》下载全文 |
