Maximally edge-connected and vertex-connected graphs and digraphs: A survey

Discrete Mathematics

Volumn 308, Issue 15, 2008, Pages 3265-3296

  Hellwig, Angelika ^a   Volkmann, Lutz ^b  

^a UNIVERSITY HOSPITAL RWTH AACHEN   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Clique number; Conditional connectivity; Connectivity; Degree sequence; Diameter; Edge connectivity; Girth; Line graph; Local edge connectivity; Minimum degree; Restricted connectivity; Super edge connectivity; Vertex connectivity

Indexed keywords

NUMBER THEORY; NUMERICAL METHODS; PARAMETER ESTIMATION;

CONDITIONAL CONNECTIVITY; CONNECTIVITY; EDGE CONNECTIVITY; LINE GRAPH; LOCAL EDGE CONNECTIVITY; MINIMUM DEGREE; MINIMUM DEGREES; RESTRICTED CONNECTIVITY; SUPER EDGE CONNECTIVITY; VERTEX CONNECTIVITY;

GRAPH THEORY;

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

References (188)

1. Ayoub J.N., and Frisch I.T. On the smallest-branch cuts in directed graphs. IEEE Trans. Circuit Theory CT-17 (1970) 249-250
2. Balbuena C., and Carmona A. On the connectivity and superconnectivity of bipartite digraphs and graphs. Ars Combin. 61 (2001) 3-21
3. Balbuena C., Carmona A., Fàbrega J., and Fiol M.A. On the connectivity and the conditional diameter of graphs and digraphs. Networks 28 (1996) 97-105
4. Balbuena C., Carmona A., Fàbrega J., and Fiol M.A. On the order and size of s-geodetic digraphs with given connectivity. Discrete Math. 174 (1997) 19-27
5. ′-optimality of graphs with small conditional diameter. Inform. Process. Lett. 95 (2005) 429-434
6. Balbuena C., Cera C., Diánez A., Garcia-Vázquez P., and Marcote X. Connectivity of graphs with given girth pair. Discrete Math. 307 (2007) 155-162
7. Balbuena C., Fàbrega J., Marcote X., and Pelayo I. Superconnected digraphs and graphs with small conditional diameters. Networks 39 (2002) 153-160
8. ′-optimality in graphs with girth g. J. Graph Theory 52 (2006) 73-86
9. Balbuena C., and Marcote X. Lower connectivities of regular graphs with small diameter. Discrete Math. 307 (2007) 1255-1265
10. Balbuena C., Marcote X., and Garcia-Vázquez P. On restricted connectivities of permutation graphs. Networks 45 (2005) 113-118
11. Bauer D., Suffel C., Boesch F., and Tindell R. Connectivity extremal problems and the design of reliable probabilistic networks. The Theory and Application of Graphs, Kalamazoo MI, 1980 (1981), Wiley, New York 45-54
12. Bauer D., and Tindell R. Graphs with prescribed connectivity and line graph connectivity. J. Graph Theory 3 (1979) 393-395
13. Bauer D., and Tindell R. The connectivity of line and total graphs. J. Graph Theory 6 (1982) 197-203
14. Boesch F. On unreliability polynomials and graph connectivity in reliable network synthesis. J. Graph Theory 10 (1986) 339-352
15. Boesch F., and Chen S. A generalization of line connectivity and optimally invulnerable graphs. SIAM J. Appl. Math. 34 (1978) 657-665
16. Boesch F., and Tindell R. Circulants and their connectivities. J. Graph Theory 8 (1984) 487-499
17. Boesch F., and Wang J.F. Super-line-connectivity properties of circulant graphs. SIAM J. Algebraic Discrete Methods 7 (1986) 89-98
18. Boland J.W., and Ringeisen R.D. On super i-connected graphs. Networks 24 (1994) 225-232
19. Bollobás B. On graphs with equal edge-connectivity and minimum degree. Discrete Math. 28 (1979) 321-323
20. Bondy J.A. Properties of graphs with constraints on the degrees. Studia Sci. Math. Hungar. 4 (1969) 473-475
21. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), The Macmillan Press, London, Basingstoke, UK
22. Bonsma P., Ueffing N., and Volkmann L. Edge-cuts leaving components of order at least three. Discrete Math. 256 (2002) 431-439
23. Brouwer A.E., and Mesner D.M. The connectivity of strongly regular graphs. European J. Combin. 6 (1985) 215-216
24. Capobianco M., and Molluzzo J.C. Examples and Counterexamples in Graph Theory (1978), North-Holland, New York, Amsterdam, Oxford xii + 259 pp
25. Carmona A., and Fàbrega J. On the superconnectivity and the conditional diameter of graphs and digraphs. Networks 34 (1999) 197-205
26. Chartrand G. A graph-theoretic approach to a communications problem. SIAM J. Appl. Math. 14 (1966) 778-781
27. Chartrand G., and Harary F. Graphs with prescribed connectivities. In: Erdös P., and Katona G. (Eds). Theory of Graphs (1968), Academic Press, London, New York, San Francisco 61-63
28. Chartrand G., Kapoor S.F., and Kronk H.V. A sufficient condition for n-connectedness of graphs. Matematika 15 (1968) 51-52
29. Chartrand G., and Lesniak L. Graphs and Digraphs. third ed. (1996), Chapman & Hall, London
30. Chartrand G., and Stewart M.J. The connectivity of line-graphs. Math. Ann. 182 (1969) 170-174
31. Chen Y.C., Tan J.J.M., Hsu L.H., and Kao S.S. Super-connectivity and super-edge-connectivity for some interconnection networks. Appl. Math. Comput. 140 (2003) 245-254
32. P. Dankelmann, A. Hellwig, L. Volkmann, On the connectivity of diamond-free graphs, Discrete Appl. Math. (2007).
33. P. Dankelmann, A. Hellwig, L. Volkmann, Inverse degree and edge-connectivity, submitted for publication.
34. Dankelmann P., and Volkmann L. New sufficient conditions for equality of minimum degree and edge-connectivity. Ars Combin. 40 (1995) 270-278
35. Dankelmann P., and Volkmann L. Degree sequence conditions for maximally edge-connected graphs and digraphs. J. Graph Theory 26 (1997) 27-34
36. Dankelmann P., and Volkmann L. Degree sequence conditions for maximally edge-connected graphs depending on the clique number. Discrete Math. 211 (2000) 217-223
37. Daven M., and Rodger C.A. (k, g)-Cages are 3-connected. Discrete Math. 199 (1999) 207-215
38. Deng H.Y., Chen J., Li Q.L., and Li R.H. On the construction of most reliable networks. Discrete Appl. Math. 140 (2004) 19-33
39. Erdös P., and Sachs H. Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 12 (1963) 251-257
40. Esfahanian A.H. Lower-bounds on the connectivities of a graph. J. Graph Theory 9 (1985) 503-511
41. Esfahanian A.H. Generalized measures of fault tolerance with application to n-cube networks. IEEE Trans. Comput. 38 (1989) 1586-1591
42. Esfahanian A.H., and Hakimi S.L. On computing a conditional edge-connectivity of a graph. Inform. Process. Lett. 27 (1988) 195-199
43. Fàbrega J., and Fiol M.A. Maximally connected digraphs. J. Graph Theory 13 (1989) 657-668
44. Fàbrega J., and Fiol M.A. Extraconnectivity of graphs with large girth. Discrete Math. 127 (1994) 163-170
45. Fàbrega J., and Fiol M.A. Bipartite graphs and digraphs with maximum connectivity. Discrete Appl. Math. 69 (1996) 271-279
46. Fàbrega J., and Fiol M.A. On the extraconnectivity of graphs. Discrete Math. 155 (1996) 49-57
47. Fàbrega J., and Fiol M.A. Further topics in connectivity. In: Gross J.L., and Yellen J. (Eds). Handbook of Graph Theory (2004), CRC Press, London, New York 300-329
48. Fan Y.M., Xu J.M., and Lu M. The restricted edge-connectivity of Kautz undirected graphs. Ars Combin. 81 (2006) 369-379
49. Faudree R., Flandrin E., and Ryjáček Z. Claw-free graphs-a survey. Discrete Math. 164 (1997) 87-147
50. Fiol M.A. Connectivity and superconnectivity of large graphs and digraphs. Ars Combin. 29B (1990) 5-16
51. Fiol M.A. On super-edge-connected digraphs and bipartite digraphs. J. Graph Theory 16 (1992) 545-555
52. Fiol M.A. The connectivity of large digraphs and graphs. J. Graph Theory 17 (1993) 31-45
53. Fiol M.A. The superconnectivity of large digraphs and graphs. Discrete Math. 124 (1994) 67-78
54. Fiol M.A., and Fàbrega J. On the distance connectivity of graphs and digraphs. Discrete Math. 125 (1994) 169-176
55. M.A. Fiol, J. Fàbrega, M. Escudero, Short paths and connectivity in graphs and digraphs, in: The 12th British Combinatorial Conference, Norwich, 1989, Ars Combin. 29B (1990) 17-31.
56. G. Fricke, O.R. Oellermann, H.C. Swart, The edge-connectivity, average edge-connectivity and degree conditions, unpublished manuscript, 2000.
57. Fu H.L., Huang K.C., and Rodger C.A. Connectivity of cages. J. Graph Theory 24 (1997) 187-191
58. D. Geller, F. Harary, Connectivity in digraphs, in: Recent Trends in Graph Theory, Proceedings of the First New York City Graph Theory Conference, 1970, Lecture Notes in Mathematics, vol. 186, 1971, pp. 105-115.
59. Godsil C., and Royle G. Algebraic Graph Theory (2001), Springer, Berlin
60. Goldsmith D.L. On the nth order edge-connectivity of a graph. Congr. Numer. 32 (1981) 375-382
61. Goldsmith D.L. The functional edge-connectivity of a graph. J. Combin. Inform. System Sci. 17 (1992) 183-193
62. Goldsmith D.L., and Entringer R.C. A sufficient condition for equality of edge-connectivity and minimum degree of a graph. J. Graph Theory 3 (1979) 251-255
63. Goldsmith D.L., and White A.T. On graphs with equal edge-connectivity and minimum degree. Discrete Math. 23 (1978) 31-36
64. E. Gyo{combining double acute accent}ri, On division of graphs to connected subgraphs, in: Combinatorics, Proceedings of the Fifth Hungarian Colloquium, Keszthely, 1976, vol. I, pp. 485-494, Colloq. Math. Soc. János Bolyai 18 (1978).
65. Hamidoune Y.O. On the connectivity of Cayley digraphs. European J. Combin. 5 (1984) 309-312
66. Hamidoune Y.O., and Tindell R. Vertex transitivity and super line connectedness. SIAM J. Discrete Math. 3 (1990) 524-530
67. Harary F. Conditional connectivity. Networks 13 (1983) 347-357
68. Harary F., and Robinson R.W. The diameter of a graph and its complement. Amer. Math. Monthly 92 (1985) 211-212
69. A. Hellwig, Maximally connected graphs and digraphs, Ph.D. Thesis, Aachen University, 2005.
70. Hellwig A., Rautenbach D., and Volkmann L. Note on the connectivity of line graphs. Inform. Process. Lett. 91 (2004) 7-10
71. Hellwig A., Rautenbach D., and Volkmann L. Cuts leaving components of given minimal order. Discrete Math. 292 (2005) 55-65
72. Hellwig A., and Volkmann L. Maximally edge-connected digraphs. Australas. J. Combin. 27 (2003) 23-32
73. Hellwig A., and Volkmann L. Maximally local-edge-connected graphs and digraphs. Ars Combin. 72 (2004) 295-306
74. ′-optimality in graphs of diameter 2. Discrete Math. 283 (2004) 113-120
75. Hellwig A., and Volkmann L. Neighborhood and degree conditions for super-edge-connected bipartite digraphs. Resultate Math. 45 (2004) 45-58
76. ′-optimal, super-edge-connected and maximally edge-connected. J. Graph Theory 48 (2005) 228-246
77. Hellwig A., and Volkmann L. Neighborhood conditions for graphs and digraphs to be maximally edge-connected. Australas. J. Combin. 33 (2005) 265-277
78. Hellwig A., and Volkmann L. On connectivity in graphs with given clique number. J. Graph Theory 52 (2006) 7-14
79. Hellwig A., and Volkmann L. Lower bounds on the vertex-connectivity of digraphs and graphs. Inform. Process. Lett. 99 (2006) 41-46
80. A. Hellwig, L. Volkmann, The connectivity of a graph and its complement, Discrete Appl. Math., to appear.
81. Imase M., Soneoka T., and Okada K. Connectivity of regular directed graphs with small diameters. IEEE Trans. Comput. 34 (1985) 267-273
82. Imrich W. On the connectivity of Cayley graphs. J. Combin. Theory Ser. B 26 (1979) 323-326
83. Jensen J.L.W.V. Sur les fonctions convexes et les inégalités entre les valeurs moyennes. Acta Math. 30 (1906) 175-193
84. Jiang T., and Mubayi D. Connectivity and separating sets of cages. J. Graph Theory 29 (1998) 35-44
85. Jolivet J.L. Sur la connexité des graphes orientés. C. R. Acad. Sci. Paris 274A (1972) 148-150
86. Kane V.G., and Mohanty S.P. A lower bound on the number of vertices of a graph. Proc. Amer. Math. Soc. 72 (1978) 211-212
87. Kelmans A.K. Asymptotic formulas for the probability of k-connectedness of random graphs. Theory Probab. Appl. 17 (1972) 243-254
88. Knor M., Niepel L., and Sǒltés L. Centers in line graphs. Math. Slovaca 43 (1993) 11-20
89. König D. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann. 77 (1916) 453-465
90. Latifi S., Hedge M., and Naraghi-Pour M. Conditional connectivity measures for large multiprocessor systems. IEEE Trans. Comput. 43 (1994) 218-222
91. Lesniak L. Results on the edge-connectivity of graphs. Discrete Math. 8 (1974) 351-354
92. Li L., and Xu J.M. On restricted edge-connectivity of vertex-transitive graphs. J. Univ. Sci. Tech. China 34 (2004) 266-272
93. Li Q.L., and Li Q. Reliability analysis of circulant graphs. Networks 31 (1998) 61-65
94. Li Q.L., and Li Q. Super edge connectivity properties of connected edge symmetric graphs. Networks 33 (1999) 157-159
95. Li T.F. Connectivity of circulant graphs. J. Math. Res. Exposition 19 (1999) 608-610 (in Chinese, in English, Chinese summary)
96. Lin Y., Miller M., Balbuena C., and Marcote X. All (k ; g)-cages edge-superconnected. Networks 47 (2006) 102-110
97. Lin Y., Miller M., and Rodger C. All (k ; g)-cages are k-edge-connected. J. Graph Theory 48 (2005) 219-227
98. Liu X. The connectivity of directed circulant graphs. J. Xinjiang Univ. Natur. Sci. 7 (1990) 31-34 (in Chinese, English summary)
99. Lovász L. A homology theory for spanning trees of a graph. Acta Math. Acad. Sci. Hungar. 30 (1977) 241-251
100. Lü M., Chen G.L., and Xu J.M. On super edge-connectivity of Cartesian product graphs. Networks 49 (2007) 152-157
101. Mader W. Über den Zusammenhang symmetrischer Graphen. Arch. Math. (Basel) 21 (1970) 331-336
102. Mader W. Minimale n-fach kantenzusammenh"angende Graphen. Math. Ann. 191 (1971) 21-28
103. W. Mader, Connectivity and edge-connectivity in finite graphs, in: B. Bollobás (Ed.), Surveys in Combinatorics, Proceedings of the Seventh British Combinatorial Conference, Cambridge, 1979, pp. 66-95, London Math. Soc. Lecture Note Series, vol. 38, Cambridge University Press, Cambridge, New York, 1979.
104. Marcote X., and Balbuena C. Edge-superconnectivity of cages. Networks 43 (2004) 54-59
105. Marcote X., Balbuena C., and Pelayo I. On the connectivity of cages with girth five, six and eight. Discrete Math. 307 (2007) 1441-1446
106. Marcote X., Balbuena C., Pelayo I., and Fàbrega J. (δ, g)-Cages with g ≥ 10 are 4-connected. Discrete Math. 301 (2005) 124-136
107. Meng J. Superconnectivity and super edge-connectivity of line graphs. Graph Theory Notes N. Y. 40 (2001) 12-14
108. Meng J. Optimally super-edge-connected transitive graphs. Discrete Math. 260 (2003) 239-248
109. Meng J. Connectivity of Cayley graphs on symmetric groups. J. Xinjiang Univ. Natur. Sci. 21 (2004) 113-119
110. Meng J., and Ji Y. On a kind of restricted edge connectivity of graphs. Discrete Appl. Math. 117 (2002) 183-193
111. Menger K. Zur allgemeinen Kurventheorie. Fund. Math. 10 (1927) 96-115
112. M.H. Moriarty, P.R. Christopher, Cages of degree k are k-edge-connected, in: The 36th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congr. Numer. 173 (2005) 161-167.
113. Oellermann O.R. Connectivity and edge-connectivity in graphs: a survey. Congr. Numer. 116 (1996) 231-252
114. Ou J.P. Restricted edge connectivity of regular graphs. J. Math. Study 34 (2001) 345-350
115. J.P. Ou, Restricted edge connectivity and network reliability, Ph.D. Thesis, Department of Mathematics, Xiamen University, 2003.
116. Ou J.P. 4-Restricted edge cuts of graphs. Australas. J. Combin. 30 (2004) 103-112
117. Ou J.P. Edge cuts leaving components of order at least m. Discrete Math. 305 (2005) 365-371
118. J.P. Ou, Ore-type conditions for maximizing 3-restricted edge connectivity of graphs, submitted for publication.
119. Ou J.P., and Zhang F.J. Bound on m-restricted edge-connectivity. Acta Math. Appl. Sinica (English Ser.) 19 (2003) 505-510
120. Ou J.P., and Zhang F.J. Reliability of undirected de Bruijn networks. Gongcheng Shuxue Xuebao 21 (2004) 947-952 (in Chinese, in English, Chinese summaries)
121. Ou J.P., and Zhang F.J. Super restricted edge connectivity of Kautz graphs. Acta Math. Sinica (Chinese Ser.) 47 (2004) 931-940 (in Chinese, in English, Chinese summaries)
122. Ou J.P., and Zhang F.J. 3-Restricted edge connectivity of vertex transitive graphs of girth three. J. Math. Res. Exposition 25 (2005) 58-63
123. Ou J.P., and Zhang F.J. 3-Restricted edge connectivity of vertex transitive graphs. Ars Combin. 74 (2005) 291-301
124. Ou J.P., and Zhang F.J. 3-Restricted edge cut of graphs. Southeast Asian Bull. Math. 29 (2005) 1107-1111
125. Ou J.P., and Zhang F.J. Super restricted edge connectivity of regular graphs. Graphs Combin. 21 (2005) 459-467
126. Pelayo I., Balbuena C., and Gómez J. On the superconnectivity of generalized p-cycles. Discrete Math. 255 (2002) 13-23
127. Plesník J. Critical graphs of given diameter. Acta Fac. Rerum Natur. Univ. Commenian Math. 30 (1975) 71-93
128. Plesník J., and Znám S. On equality of edge-connectivity and minimum degree of a graph. Arch. Math. (Brno) 25 (1989) 19-25
129. Prisner E. Line graphs and generalizations-a survey. Congr. Numer. 116 (1996) 193-229
130. p, q-connectedness, submitted for publication.
131. D. Rautenbach, L. Volkmann, Cyclic sums, network sharing and restricted edge cuts in graphs with long cycles, submitted for publication.
132. D. Rautenbach, L. Volkmann, On the existence of edge cuts leaving several large components, submitted for publication.
133. Ringel G. Selbstkomplementäre Graphen. Arch. Math. (Basel) 14 (1963) 354-358
134. Sampathkumar E. Connectivity of a graph-a generalization. J. Combin. Inform. System Sci. 9 (1984) 71-78
135. Seidman S.B. Network structure and minimum degree. Social Networks 5 (1983) 269-287
136. ′. Networks 49 3 (2007) 234-242
137. Shieh B.S. Super edge- and point-connectivities of the Cartesian product of regular graphs. Networks 40 (2002) 91-96
138. Soneoka T. Super edge-connectivity of dense digraphs and graphs. Discrete Appl. Math. 37/38 (1992) 511-523
139. Soneoka T., Nakada H., and Imase M. Sufficient conditions for dense graphs to be maximally connected. Proc. ISCAS 85 (1985) 811-814
140. Soneoka T., Nakada H., Imase M., and Peyrat C. Sufficient conditions for maximally connected dense graphs. Discrete Math. 63 (1987) 53-66
141. Sun H.Q. The connectivity of line graphs. Chinese Ann. Math. Ser. A 7 (1986) 602-605 (in Chinese)
142. Topp J., and Volkmann L. Sufficient conditions for equality of connectivity and minimum degree of a graph. J. Graph Theory 17 (1993) 695-700
143. Turán P. An extremal problem in graph theory. Mat. Fiz. Lapok 48 (1941) 436-452
144. Tutte W.T. A family of cubical graphs. Proc. Cambridge Philos. Soc. 43 (1947) 459-474
145. Ueffing N., and Volkmann L. Restricted edge-connectivity and minimum edge-degree. Ars Combin. 66 (2003) 193-203
146. Volkmann L. Bemerkungen zum p-fachen Zusammenhang von Graphen. An. Univ. Bucuresti Mat. 37 (1988) 75-79
147. Volkmann L. Edge-connectivity in p-partite graphs. J. Graph Theory 13 (1989) 1-6
148. Volkmann L. Fundamente der Graphentheorie (1996), Springer, Wien, New York
149. Volkmann L. Degree sequence conditions for equal edge-connectivity and minimum degree depending on the clique number. J. Graph Theory 42 (2003) 234-245
150. Volkmann L. Degree sequence conditions for super-edge-connected graphs and digraphs. Ars Combin. 67 (2003) 237-249
151. Volkmann L. Sufficient conditions for super-edge-connected graphs depending on the clique number. J. Combin. Math. Combin. Comput. 49 (2004) 3-8
152. Volkmann L. Degree sequence conditions for maximally edge-connected oriented graphs. Appl. Math. Lett. 19 (2006) 1255-1260
153. L. Volkmann, Graphen an allen Ecken und Kanten, vol. XVI, RWTH Aachen, 2006, 377pp. 〈http://www.math2.rwth-aachen.de/∼uebung/GT/graphen1.html〉.
154. L. Volkmann, Local-edge-connectivity in digraphs and oriented graphs, Discrete Math. (2007), doi:10.1016/j.disc.2007.03.051.
155. L. Volkmann, Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number, Ars Combin., to appear.
156. Volkmann L. Lower bounds on the vertex-connectivity of oriented graphs and bipartite oriented graphs. Utilitas Math. 73 (2007) 45-54
157. L. Volkmann, Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number, Ars Combin., to appear.
158. L. Volkmann, On local connectivity of graphs, Appl. Math. Lett., to appear.
159. Volkmann L. Restricted arc-connectivity of digraphs. Inform. Process. Lett. 103 (2007) 234-239
160. L. Volkmann, Degree sequence conditions for super-edge-connected oriented graphs, J. Combin. Math. Combin. Comput., to appear.
161. L. Volkmann, Edge-cuts leaving components of given minimal order, submitted for publication.
162. Wang P., Xu B., and Wang J. A note on the edge-connectivity of cages. Electron. J. Combin. 10 2 (2003) 4pp.
163. Wang Y.Q. Super restricted edge-connectivity of vertex-transitive graphs. Discrete Math. 289 (2004) 199-205
164. Wang Y.Q. Optimization problems of the third edge-connectivity of graphs. Sci. China Ser. A 49 (2006) 791-799
165. Wang Y.Q., and Li Q. Super edge connectivity properties of graphs with diameter. J. Shanghai Jiaotong Univ. 33 6 (1999) 646-649 (Chinese Ed.)
166. Wang Y.Q., and Li Q. A sufficient condition for an equality between restricted edge-connectivity and minimum edge-degree of graphs. Appl. Math. J. Chinese Univ. Ser. A 16 (2001) 269-275 (in Chinese, in English, Chinese summary)
167. Wang Y.Q., and Li Q. Conditional edge connectivity properties. reliability comparisons and transitivity of graphs, Discrete Math. 258 (2002) 205-214
168. Wang Y.Q., and Li Q. Upper bound of the third edge-connectivity of graphs. Sci. China Ser. A 48 (2005) 360-371
169. Watkins M.E. A lower bound for the number of vertices of a graph. Amer. Math. Monthly 74 (1967) 297
170. Watkins M.E. Connectivity of transitive graphs. J. Combin. Theory 8 (1970) 23-29
171. Whitney H. Congruent graphs and the connectivity of graphs. Amer. J. Math. 54 (1932) 150-168
172. Wong P.K. Cages-a survey. J. Graph Theory 6 (1982) 1-22
173. Wu J., and Guo G. Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets. IEEE Trans. Comput. 47 (1998) 888-893
174. Xu B., Wang P., and Wang J. On the connectivity of (4,g)-cages. Ars Combin. 64 (2002) 181-192
175. Xu J.M. A sufficient condition for equality of arc-connectivity and minimum degree of a digraph. Discrete Math. 133 (1994) 315-318
176. Xu J.M. Restricted edge-connectivity of vertex-transitive graphs. Chinese J. Contemp. Math. 21 (2000) 369-374
177. J.M. Xu, Super or restricted connectivity of graphs-a survey, unpublished manuscript, 2005.
178. J.M. Xu, M. Lü, Y.M. Fan, The restricted edge-connectivity of de Bruijn undirected graphs, Ars Combin. 83 (2007) 321-333.
179. Xu J.M., Lü M., Ma M., and Hellwig A. Super connectivity of line graphs. Inform. Process. Lett. 94 (2005) 191-195
180. Xu J.M., and Xu K.L. On restricted edge-connectivity of graphs. Discrete Math. 243 (2002) 291-298
181. Zamfirescu T. On a theorem of Chartrand, Kapoor and Kronk. Rend. Circ. Mat. Palermo 18 (1969) 319-322
182. Zamfirescu T. On the line-connectivity of line-graphs. Math. Ann. 187 (1970) 305-309
183. Zhang X.M., and Xu J.M. On connectivity of Möbius cubes. Math. Appl. (Wuhan) 17 (2004) 56-60
184. Zhang Z. Graph operations and super edge connectivity. J. Zhengzhou Univ. Natur. Sci. Ed. 36 (2004) 1-6
185. Z. Zhang, Sufficient conditions for restricted-edge-connectivity to be optimal, Discrete Math. (2007), doi:10.1016/j.disc.2007.01.016.
186. (3) transitive graphs. Discrete Appl. Math. 154 (2006) 1011-1018
187. Zhang Z., and Yuan J. A proof of an inequality concerning k-restricted edge connectivity. Discrete Math. 304 (2005) 128-134
188. Zhang Z., and Yuan J. Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. Discrete Math. 307 (2007) 293-298