Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
Authors:
- Zhao ZhangZZZhao Zhang
- 1 January 2007
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 307 (2) , 293-298
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Optimally super-edge-connected transitive graphsDiscrete Mathematics, 2003
- Edge-cuts leaving components of order at least threeDiscrete Mathematics, 2002
- On Isoperimetric Connectivity in Vertex-Transitive GraphsSIAM Journal on Discrete Mathematics, 2000
- Degree sequence conditions for maximally edge-connected graphs and digraphsJournal of Graph Theory, 1997
- Generalized measures of fault tolerance with application to N-cube networksIEEE Transactions on Computers, 1989
- On computing a conditional edge-connectivity of a graphInformation Processing Letters, 1988
- On graphs with equal edge connectivity and minimum degreeDiscrete Mathematics, 1979
- On graphs with equal edge-connectivity and minimum degreeDiscrete Mathematics, 1978
- Results on the edge-connectivity of graphsDiscrete Mathematics, 1974
- A Graph-Theoretic Approach to a Communications ProblemSIAM Journal on Applied Mathematics, 1966