Sufficient conditions for λ′-optimality in graphs of diameter 2

Discrete Mathematics

Volumn 283, Issue 1-3, 2004, Pages 113-120

  Hellwig, Angelika ^a   Volkmann, Lutz ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Diameter; Edge connectivity; Edge cut; Restricted edge connectivity

Indexed keywords

BOUNDARY CONDITIONS; FUNCTIONS; SET THEORY; THEOREM PROVING;

CONNECTED GRAPHS; DIAMETER; EDGE-CUT; RESTRICTED EDGE-CONNECTIVITY;

GRAPH THEORY;

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

References (12)

1. Balbuena C., Pelayo I., Gómez J. On the superconnectivity of generalized. p-cycles Discrete Math. 255:2002;13-23.
2. Chartrand G., Lesniak L. Graphs and Digraphs. 3rd Edition:1996;Chapman & Hall, London.
3. Esfahanian A.-H., Hakimi S.L. On computing a conditional edge-connectivity of a graph. Inform. Process. Lett. 27:1988;195-199.
4. Fiol M.A. On super-edge-connected digraphs and bipartite digraphs. J. Graph Theory. 16:1992;169-176.
5. A. Hellwig, L. Volkmann, Sufficient conditions for graphs to be λ ′-optimal, super-edge-connected and maximally edge-connected, submitted.
6. Latifi S., Hedge M., Naraghi-Pour M. Conditional connectivity measures for large multiprocessor systems. IEEE Trans. Comput. 43:1994;218-222.
7. Li Q., Li Q. Reliability analysis of circulant graphs. Networks. 31:1998;61-65.
8. Plesník J. Critical graphs of given diameter. Acta Fac. Rerum Natur. Univ. Commenian Math. 30:1975;71-93.
9. Ueffing N., Volkmann L. Restricted edge-connectivity and minimum edge-degree. Ars Combin. 66:2003;193-203.
10. Wang Y., Li Q. Super-edge-connectivity properties of graphs with diameter 2. J. Shanghai Jiaotong Univ. (Chin. Ed.). 33(6):1999;646-649.
11. Wu J., Guo G. Fault tolerance measures for. m-ary n-dimensional hypercubes based on forbidden faulty sets IEEE Trans. Comput. 47:1998;888-893.
12. Xu J.-M., Xu K.-L. On restricted edge-connectivity of graphs. Discrete Math. 243:2002;291-298.