Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-connected if κG≥k, maximally connected if κG=δG, and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present sufficient conditions for a graph with given...
Main Authors: | Zhen-Mu Hong, Zheng-Jiang Xia, Fuyuan Chen, Lutz Volkmann |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2021-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2021/5588146 |
Similar Items
-
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
by: Lutz Volkmann, et al.
Published: (2017-01-01) -
Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number
by: Volkmann Lutz
Published: (2019-05-01) -
A Sufficient Condition for Graphs to Be Super K-Restricted Edge Connected
by: Wang Shiying, et al.
Published: (2017-08-01) -
Sufficient conditions on the zeroth-order general Randi\'{c} index for maximally edge-connected digraphs
by: L. Volkmann
Published: (2016-06-01) -
The Super-Connectivity of Kneser Graphs
by: Ekinci Gülnaz Boruzanli, et al.
Published: (2019-02-01)