Title of article
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Author/Authors
Volkmann ، Lutz RWTH Aachen University , Hong ، Zhen-Mu School of Finance - Anhui University of Finance and Economics
From page
35
To page
41
Abstract
Let G be a connected graph with minimum degree δ and edgeconnectivity λ. A graph is maximally edge-connected if λ = δ, and it is superedge-connected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is maximally edge-connected or super-edge-connected if the number of edges is large enough.
Keywords
Edge , connectivity , Maximally edge , connected graphs , Superedge , connected graphs
Journal title
Communications in Combinatorics and Optimization
Journal title
Communications in Combinatorics and Optimization
Record number
2696190
Link To Document