On super restricted edge-connectivity of edge-transitive graphs
Authors:
- Yingzhi TianYTYingzhi Tian
- Jixiang MengJMJixiang Meng
- 1 September 2010
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 310 (17-18) , 2273-2279
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Sufficient conditions for restricted-edge-connectivity to be optimalDiscrete Mathematics, 2007
- Super connectivity of line graphsInformation Processing Letters, 2005
- Super restricted edge-connectivity of vertex-transitive graphsDiscrete Mathematics, 2004
- Optimally super-edge-connected transitive graphsDiscrete Mathematics, 2003
- On restricted edge-connectivity of graphsDiscrete Mathematics, 2002
- 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
- Combinatorial optimization problems in the analysis and design of probabilistic networksNetworks, 1985
- Circulants and their connectivitiesJournal of Graph Theory, 1984
- Conditional connectivityNetworks, 1983