Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2

Discrete Mathematics

Volumn 309, Issue 4, 2009, Pages 908-919

  Wang, Shiying ^a   Lin, Shangwei ^a   Li, Chunfang ^b  

^a SHANXI UNIVERSITY   (China)

^b Jinzhong University   (China)

Author keywords

k optimality; Diameter; Isoperimetric edge connectivity; Restricted edge connectivity

Indexed keywords

CARDINALITY; CONNECTED GRAPHS; DIAMETER; EDGE-SETS; ISOPERIMETRIC EDGE CONNECTIVITY; K-RESTRICTED EDGE CONNECTIVITIES; K-RESTRICTED EDGE CUTS; NON-ADJACENT VERTICES; RESTRICTED EDGE CONNECTIVITY; SPECIAL CLASS; SUBGRAPH; SUFFICIENT CONDITIONS;

GRAPH THEORY;

EID: 60149101423     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.01.037     Document Type: Article

References (21)

1. Balbuena C., Carmona A., Fàbrega J., and Fiol M.A. Superconnectivity of bipartite digraphs and graphs. Discrete Math. 197-198 (1999) 61-75
2. Balbuena C., Marcote X., and García-Vázquez P. On restricted connectivities of permutation graphs. Networks 45 (2005) 113-118
3. ′-optimality in graphs with girth g. J. Graph Theory 52 (2006) 73-86
4. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), The Macmillan Press Ltd, New York
5. Bonsma P., Ueffing N., and Volkmann L. Edge-cuts leaving components of order at least three. Discrete Math. 256 (2002) 431-439
6. Esfahanian A.H., and Hakimi S.L. On computing a conditional edge-connectivity of a graph. Inform. Process. Lett. 27 (1988) 195-199
7. Fàbrega J., and Fiol M.A. On the extraconnectivity of graphs. Discrete Math. 155 (1996) 49-57
8. Hamidoune Y.O., Lladó A.S., Serra O., and Tindell R. On isoperimetric connectivity in vertex-transitive graphs. SIAM J. Discrete Math. 13 (2000) 139-144
9. ′-optimality in graphs of diameter 2. Discrete Math. 283 (2004) 113-120
10. ′-optimal, super-edge-connected, and maximally edge-connected. J. Graph Theory 48 (2005) 228-246
11. Lesniak L. Results on the edge-connectivity of graphs. Discrete Math. 8 (1974) 351-354
12. Li Q.L., and Li Q. Reliability analysis of circulant graphs. Networks 31 (1998) 61-65
13. Meng J.X. Optimally super-edge-connected transitive graphs. Discrete Math. 260 (2003) 239-248
14. Meng J.X., and Ji Y.H. On a kind of restricted edge connectivity of graphs. Discrete Appl. Math. 117 (2002) 183-193
15. Ou J.P. Edge cuts leaving components of order at least m. Discrete Math. 305 (2005) 365-371
16. Plesnik J. Critical graphs of given diameter. Acta Fac. Rerum Natur. Univ. Commenian Math. 30 (1975) 71-93
17. Soneoka T., Nakada H., Imase M., and Peyrat C. Sufficient conditions for maximally connected dense graphs. Discrete Math. 63 (1987) 53-66
18. Wang M., and Li Q. Conditional edge connectivity properties, reliability comparison and transitivity of graphs. Discrete Math. 258 (2002) 205-214
19. Xu J.M., and Xu K.L. On restricted edge-connectivity of graphs. Discrete Math. 243 (2002) 291-298
20. Zhang Z., and Yuan J.J. A proof of an inequality concerning k-restricted edge connectivity. Discrete Math. 304 (2005) 128-134
21. Zhang Z., and Yuan J.J. Degree conditions for restricted-edge connectivity and isoperimetric-edge-connectivity to be optimal. Discrete Math. 307 (2007) 293-298