超连通图的充分条件

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 d...

Full description

Saved in:
Bibliographic Details
Published inZhejiang da xue xue bao. Journal of Zhejiang University. Sciences edition. Li xue ban Vol. 45; no. 4; pp. 391 - 393
Main Author 郭利涛
Format Journal Article
LanguageChinese
Published 厦门理工学院应用数学学院,福建厦门,361024 01.07.2018
Zhejiang University Press
Subjects
connectivity
inverse degree
super connected
超连通
逆度
连通度
Online AccessGet full text
ISSN1008-9497
DOI10.3785/j.issn.1008-9497.2018.04.001

Cover

More Information
Summary: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 . In this paper,we show that let G be a connected graph with order n and minimum degree δ, if , then G is super-κ.
ISSN:1008-9497
DOI:10.3785/j.issn.1008-9497.2018.04.001