Sufficient conditions for λ′ -optimality in graphs with girth g

Journal of Graph Theory

Volumn 52, Issue 1, 2006, Pages 73-86

  Balbuena, C ^a   Garcia Vazquez P ^b   Marcote, X ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Diameter; Edge connectivity; Edge cut; Girth

Indexed keywords

MATHEMATICAL MODELS; NUMBER THEORY; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

DIAMETERS; EDGE-CONNECTIVITY; EDGE-CUTS; GIRTHS;

GRAPH THEORY;

EID: 33646346635     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20150     Document Type: Article

References (17)

1. 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, Inf Process Lett 95 (2005), 429-434.
2. D. Bauer, F. T. Boesch, C. Suffel, and R. Tindell, Connectivity extremal problems and design of reliable probabilistic networks, In The Theory and Application of Graphs, G. Chartrand, Y. Alavi, D. Goldsmith, L. Lesniak Foster, and D. Lick (Eds), Wiley, New York, 1981, pp. 45-54.
3. F.T. Boesch, Synthesis of reliable networks-A survey, IEEE Trans Reliability 35 (1986), 240-246.
4. F.T. Boesch and R. Tindell, Circulants and their connectivities, J Graph Theory 8(4) (1984), 487-499.
5. G. Chartrand and L. Lesniak, Graphs and Digraphs, 3rd edition, Chapman and Hall, London, UK, 1996.
6. A.H. Esfahanian and S.L. Hakimi, On computing a conditional edge-connectivity of a graph, Inf Process Lett 27 (1988), 195-199.
7. J. Fàbrega and M. A. Fiol, Maximally connected digraphs, J Graph Theory 13(3) (1989), 657-668.
8. M. A. Fiol, J. Fàbrega, and M. Escudero, Short paths and connectivity in graphs and digraphs, Ars Combin 29B (1990), 17-31.
9. M.A. Fiol, On super-edge-connected digraphs and bipartite digraphs, J Graph Theory 16 (1992), 545-555.
10. A. Hellwig and L. Volkmann, Sufficient conditions for λ′-optimality in graphs of diameter 2, Discrete Math 283 (2004), 113-120.
11. Q. Li and Q. Li, Reliability analysis of circulant graphs, Networks 31 (1998), 61-65.
12. J. Ou and F. Zhang, 3-restricted edge connectivity of vertex transitive graphs, Ars Combin 74 (2005), 291-301.
13. T. Soneoka, H. Nakada, M. Imase, and C. Peyrat, Sufficient conditions for maximally connected dense graphs. Discrete Math 63(1) (1987), 53-66.
14. T. Soneoka, Super edge-connectivity of dense digraphs and graphs, Discrete Applied Math 37/38 (1992), 511-523.
15. N. Ueffing and L. Volkmann, Restricted edge-connectivity and minimum edge-degree, Ars Combin 66 (2003), 193-203.
16. L. Volkmann, Degree sequence conditions for super-edge-connected graphs and digraphs, Ars Combin 67 (2003), 237-249.
17. J.-M. Xu and K.-L. Xu, On restricted edge-connectivity of graphs, Discrete Math 243 (2002), 291-298.