Sufficient conditions for λ′-optimality of graphs with small conditional diameter

Information Processing Letters

Volumn 95, Issue 4, 2005, Pages 429-434

  Balbuena, C ^a   Cera, M ^b   Dianez A ^b   Garcia Vazquez P ^b   Marcote, X ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Conditional diameter; Fault tolerance; Restricted edge connectivity

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CONDITIONAL DIAMETER; CONNECTED GRAPHS; ISOLATED VERTICES; RESTRICTED EDGE-CONNECTIVITY;

GRAPH THEORY;

EID: 21344474392     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.05.006     Document Type: Article

References (7)

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, P. García-Vázquez, X. Marcote, Sufficient conditions for λ ′ -optimality in graphs with girth g, Preprint
3. G. Chartrand, and L. Lesniak Graphs and Digraphs third ed. 1996 Chapman and Hall London, UK
4. A.H. Esfahanian, and S.L. Hakimi On computing a conditional edge-connectivity of a graph Inform. Process. Lett. 27 1988 195 199
5. J. Fàbrega, and M.A. Fiol Maximally connected digraphs J. Graph Theory 13 3 1989 657 668
6. A. Hellwig, and L. Volkman Sufficient conditions for λ ′ -optimality in graphs of diameter 2 Discrete Math. 283 2004 113 120
7. T. Soneoka, H. Nakada, M. Imase, and C. Peyrat Sufficient conditions for maximally connected dense graphs Discrete Math. 63 1 1987 53 66