A Sufficient Condition for Graphs to Be Super K-Restricted Edge Connected
For a subset S of edges in a connected graph G, S is a k-restricted edge cut if G − S is disconnected and every component of G − S has at least k vertices. The k-restricted edge connectivity of G, denoted by λk(G), is defined as the cardinality of a minimum k-restricted edge cut. Let ξk(G) = min{|[X...
Main Authors: | Wang Shiying, Wang Meiyu, Zhang Lei |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2017-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1939 |
Similar Items
-
Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number
by: Volkmann Lutz
Published: (2019-05-01) -
On 3-Restricted Edge Connectivity of Replacement Product Graphs
by: Yilan Cui, et al.
Published: (2023-05-01) -
Edge-Connectivity and Edges of Even Factors of Graphs
by: Haghparast Nastaran, et al.
Published: (2019-05-01) -
On k-regular edge connectivity of chemical graphs
by: Ediz Süleyman, et al.
Published: (2022-07-01) -
The Super-Connectivity of Kneser Graphs
by: Ekinci Gülnaz Boruzanli, et al.
Published: (2019-02-01)