Sufficient conditions for a graph to be super restricted edge-connected

Networks

Volumn 51, Issue 3, 2008, Pages 200-209

  Wang, Shiying ^a   Lin, Shangwei ^a  

^a SHANXI UNIVERSITY   (China)

Author keywords

Diameter; girth; Restricted edge connectivity; Super restricted edge connected graphs

Indexed keywords

TRAJECTORIES;

CONNECTED GRAPHS; DIAMETER GIRTH; RESTRICTED EDGE CONNECTIVITY; SUPER RESTRICTED EDGE-CONNECTED GRAPHS;

GRAPH THEORY;

EID: 51349106662     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20217     Document Type: Article

References (19)

1. C. Balbuena, A. Carmona, J. Fábrega, and M.A. Fiol, On the connectivity and the conditional diameter of graphs and digraphs, Networks 28 (1996), 97-105.
2. C. Balbuena, A. Carmona, J. Fábrega, and M.A. Fiol, Super-connectivity of bipartite digraphs and graphs, Discr Math 197-198 (1999), 61-75.
3. C. Balbuena, M. Cera, A. Diánez, P. García-Vázquez, and X. Marcote, Sufficient conditions for λ′-optimality of graphs with small conditional diameter, Inform Process Lett 95 (2005), 429-434.
4. C. Balbuena, P. García-Vázquez, and X. Marcóte, Sufficient conditions for λ′-optimality in graphs with girth g, J Graph Theor 52 (2006), 73-86.
5. M.O. Ball, Complexity of network reliability computation, Networks 10 (1980), 153-165.
6. D. Bauer, F. Boesch, C. Suffel, and R. Tindell, "Connectivity extremal problems and the design of reliable probabilistic networks", The theory and application of graphs, Wiley, New York, 1981, pp. 89-98.
7. D. Bauer, F. Boesch, C. Suffel, and R. Tindell, Combinatorial optimization problem in analysis and design of probabilistic networks, Networks 15 (1985), 257-271.
8. J.A. Bondy and U.S.R. Murty, Graph theory with applications, The Macmillan Press Ltd, New York, 1976.
9. A.H. Esfahanian and S.L. Hakimi, On computing a conditional edge-connectivity of a graph, Inform Process Lett 27 (1988), 195-199.
10. J. Fábrega and M.A. Fiol, Maximally connected digraphs, J Graph Theor 13 (1989), 657-668.
11. J. Fábrega and M.A. Fiol, On the extraconnectivity of graphs, Discr Math 155 (1996), 49-57.
12. Y.M. Fan, A sufficient condition for super restricted edgeconnectivity, J Guangxi Univ Technol (Chin Ed) 14 (2003), 66-68.
13. A. Hellwig and L. Volkmann, Sufficient conditions for λ′-optimality in graphs of diameter 2, Discr Math 283 (2004), 113-120.
14. A. Hellwig and L. Volkmann, Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edgeconnected, J Graph Theor 48 (2005), 228-246.
15. Q.L. Li and Q. Li, Reliability analysis of circulant graphs, Networks 31 (1998), 61-65.
16. J.S. Provan and M.O. Ball, The complexity of counting cuts and of computing the probability that a graph is connected, SIAM J Comput 12 (1983), 777-788.
17. T. Soneoka, H. Nakada, M. Imase, and C. Peyrat, Sufficient conditions for maximally connected dense graphs, Discr Math 63 (1987), 53-66.
18. M. Wang and Q. Li, Conditional edge connectivity properties, reliability comparisons and transitivity of graphs, Discr Math 258 (2002), 205-214.
19. Y.Q. Wang and Q. Li, A sufficient condition for the equality between the restricted edge-connectivity and minimum edgedegree of graphs, Appl Math J Chin Univ Ser A (Chin Ed) 16 (2001), 269-275.