On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
Authors:
- Weihua YangWYWeihua Yang
- Zhao ZhangZZZhao Zhang
- Chengfu QinCQChengfu Qin
- Xiaofeng GuoXGXiaofeng Guo
- 1 December 2011
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 311 (23-24) , 2683-2689
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education of the People's Republic of China (208161)
- China Scholarship Council
- Program for New Century Excellent Talents in University
- National Natural Science Foundation of China (10831001, 10971255, 11171279)
This publication has 13 references indexed in Scilit:
- Maximally edge-connected and vertex-connected graphs and digraphs: A surveyDiscrete Mathematics, 2008
- Super restricted edge-connectivity of vertex-transitive graphsDiscrete Mathematics, 2004
- Optimally super-edge-connected transitive graphsDiscrete Mathematics, 2003
- Super edge connectivity properties of connected edge symmetric graphsNetworks, 1999
- Extraconnectivity of graphs with large girthDiscrete Mathematics, 1994
- Conditional connectivity measures for large multiprocessor systemsIEEE Transactions on Computers, 1994
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A surveyParallel Computing, 1993
- Graphs without quadrilateralsJournal of Combinatorial Theory, Series B, 1983
- Minimalen-fach kantenzusammenh ngende GraphenMathematische Annalen, 1971
- Über ein Problem von K. ZarankiewiczActa Mathematica Hungarica, 1958