Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number
Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. The clique number...
| Published in: | Discussiones Mathematicae Graph Theory |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2019-05-01
|
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2096 |