Super p-restricted edge connectivity of line graphs

Information Sciences

Volumn 179, Issue 18, 2009, Pages 3122-3126

  Lin, Shangwei ^a   Wang, Shiying ^a  

^a SHANXI UNIVERSITY   (China)

Author keywords

Fault tolerance; Interconnection networks; Line graphs; Restricted connectivity; Super restricted edge connected graphs

Indexed keywords

CONNECTED GRAPH; EDGE CONNECTIVITY; LINE GRAPH; LINE GRAPHS; NETWORK RELIABILITY; RESTRICTED CONNECTIVITY; RESTRICTED EDGE CONNECTIVITY; SUFFICIENT CONDITIONS; SUPER RESTRICTED EDGE-CONNECTED GRAPHS;

FAULT TOLERANCE; GRAPH THEORY; INTERCONNECTION NETWORKS; PUMPS;

QUALITY ASSURANCE;

EID: 67649803119     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.05.005     Document Type: Article

References (28)

1. 2-path graphs. Discrete Mathematics 269 (2003) 13-20
2. Balbuena C., Marcote X., and Ferrero D. Diameter vulnerability of iterated line digraphs in terms of the girth. Networks 45 (2004) 49-54
3. Boesch F., and Tindell R. Circulants and their connectivities. Journal of Graph Theory 8 (1984) 487-499
4. Boesch F. Synthesis of reliable networks - a survey. IEEE Transactions on Reliability 35 (1986) 240-246
5. Bondy J.A., and Murty U.S.R. Graph Theory (2007), Springer, New York
6. Chen Z., and Fu K.S. On the connectivity of clusters. Information Sciences 8 (1975) 283-299
7. Cheng E., Lesniak L., Lipman M.J., and Lipták L. Conditional matching preclusion sets. Information Sciences 179 (2009) 1092-1101
8. Das S.R., and Sheng C.L. Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs. Information Sciences 14 (1978) 181-187
9. Esfahanian A.H., and Hakimi S.L. On computing a conditional edge-connectivity of a graph. Information Processing Letters 27 (1988) 195-199
10. Fábrega J., and Fiol M.A. On the extraconnectivity of graphs. Discrete Mathematics 155 (1996) 49-57
11. Fiol M.A., Yebra J.L.A., and De Miquel I.A. Line Digraph Iterations and the (d, k) Digraph Problem. IEEE Transactions on Computers 33 (1984) 400-403
12. Fu J.-S. Longest fault-free paths in hypercubes with vertex faults. Information Sciences 176 (2006) 759-771
13. Hellwig A., Rautenbach D., and Volkmann L. Cuts leaving components of given minimal order. Discrete Mathematics 292 (2005) 55-65
14. Hellwig A., and Volkmann L. Maximally edge-connected and vertex-connected graphs and digraphs: A survey. Discrete Mathematics 308 (2008) 3265-3296
15. Li Q.L., and Li Q. Reliability analysis of circulant graphs. Networks 31 (1998) 61-65
16. Lin M.-S., Chang M.-S., and Chen D.-J. Efficient algorithms for reliability analysis of distributed computing systems. Information Sciences 117 (1999) 89-106
17. Lü M., Chen G.L., and Xu J.M. On super edge-connectivity of Cartesian product graphs. Networks 49 (2007) 152-157
18. Ou J.P., and Zhang F.J. Super restricted edge connectivity of regular graphs. Graphs and Combinatorics 21 (2005) 459-467
19. S.M. Reddy, J.G. Kuhl, S.H. Hosseini, H. Lee, On digraphs with minimum diameter and maximum connectivity, in: Proceedings of the 20th Annual Allerton Conference, 1982, pp. 1018-1026.
20. Soh S., Rai S., and Trahan J.L. Improved lower bounds on the reliability of hypercube architectures. IEEE Transactions on Parallel and Distributed Systems 5 (1994) 364-378
21. Soneoka T. Super edge-connectivity of dense digraphs and graphs. Discrete Applied Mathematics 37/38 (1992) 511-523
22. Volkmann L. Degree sequence conditions for super-edge-connected graphs and digraphs. Ars Combinatoria 67 (2003) 237-249
23. Wang S.Y., and Lin S.W. Sufficient conditions for a graph to be super restricted edge-connected. Networks 51 (2008) 200-209
24. Wang S.Y., Lin S.W., and Li C.F. Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2. Discrete Mathematics 309 (2009) 908-919
25. Whitney H. Congruent graphs and the connectivity of graphs. American Journal of Mathematics 54 (1932) 150-168
26. Wu X., and Latifi S. Substar reliability analysis in star networks. Information Sciences 178 (2008) 2337-2348
27. Xu J.M., Lü M., Ma M.J., and Hellwig A. Super connectivity of line graphs. Information Processing Letters 94 (2005) 191-195
28. Zhu Q., Xu J.-M., Hou X., and Xu M. On reliability of the folded hypercubes. Information Sciences 177 (2007) 1782-1788