Sufficient conditions for restricted-edge-connectivity to be optimal
Author:
- Zhao ZhangZZZhao Zhang
- 1 October 2007
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 307 (22) , 2891-2899
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimalDiscrete Mathematics, 2007
- A proof of an inequality concerning k-restricted edge connectivityDiscrete Mathematics, 2005
- Optimally super-edge-connected transitive graphsDiscrete Mathematics, 2003
- On restricted edge-connectivity of graphsDiscrete Mathematics, 2002
- On the extraconnectivity of graphsDiscrete Mathematics, 1996
- Maximally connected digraphsJournal of Graph Theory, 1989
- 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
- Conditional connectivityNetworks, 1983
- On graphs with equal edge connectivity and minimum degreeDiscrete Mathematics, 1979