References
- Bondy JA, Murty USR. Graph theory with applications. New York: The Macmillan Press Ltd.; 1976.
- Bollobás B. On graphs with equal edge connectivity and minimum degree. Discrete Math. 1979;28:321–323. doi: https://doi.org/10.1016/0012-365X(79)90139-0
- Chartrand G. A graph-theoretic approach to a communications problem. SIAM J Appl Math. 1966;14:778–781. doi: https://doi.org/10.1137/0114065
- Dankelmann P, Volkmann L. Degree sequence conditions for maximally edge-connected graphs and digraphs. J Graph Theory. 1997;26:27–34. doi: https://doi.org/10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J
- Fàbrega J, Fiol MA. Maximally connected digraphs. J Graph Theory. 1989;13:657–668. doi: https://doi.org/10.1002/jgt.3190130603
- Goldsmith DL, White AT. On graphs with equal edge-connectivity and minimum degree. Discrete Math. 1978;23:31–36. doi: https://doi.org/10.1016/0012-365X(78)90184-X
- Lesniak L. Results on the edge-connectivity of graphs. Discrete Math. 1974;8:351–354. doi: https://doi.org/10.1016/0012-365X(74)90154-X
- Soneoka T, Nakada H, Imase M, et al. Sufficient conditions for maximally connected dense graphs. Discrete Math. 1987;63:53–66. doi: https://doi.org/10.1016/0012-365X(87)90151-8
- Esfahanian AH. Generalized measures of fault tolerance with application to n-cube networks. IEEE Trans Comput. 1989;38:1586–1591. doi: https://doi.org/10.1109/12.42131
- Esfahanian AH, Hakimi SL. On computing a conditional edge-connectivity of a graph. Inform Process Lett. 1988;27:195–199. doi: https://doi.org/10.1016/0020-0190(88)90025-7
- Wang M, Li Q. Conditional edge connectivity properties, reliability comparisons and transitivity of graphs. Discrete Math. 2002;258:205–214. doi: https://doi.org/10.1016/S0012-365X(02)00299-6
- Li QL, Li Q. Reliability analysis of circulants. Networks. 1998;31:61–65. doi: https://doi.org/10.1002/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H
- Li QL, Li Q. Super edge connectivity properties of connected edge symmetric graphs. Networks. 1999;33:147–159. doi: https://doi.org/10.1002/(SICI)1097-0037(199903)33:2<157::AID-NET6>3.0.CO;2-D
- Meng JX. Optimally super-edge-connected transitive graphs. Discrete Math. 2003;260:239–248. doi: https://doi.org/10.1016/S0012-365X(02)00675-1
- Xu JM, Xu KL. On restricted edge-connectivity of graphs. Discrete Math. 2002;243:291–298. doi: https://doi.org/10.1016/S0012-365X(01)00232-1
- Fàbrega J, Fiol MA. On the extraconnectivity of graphs. Discrete Math. 1996;155:49–57. doi: https://doi.org/10.1016/0012-365X(94)00369-T
- Bonsma P, Ueffing N, Volkmann L. Edge-cuts leaving components of order at least three. Discrete Math. 2002;256:431–439. doi: https://doi.org/10.1016/S0012-365X(02)00385-0
- Zhang Z, Yuan JJ. A proof of an inequality concerning k-restricted edge connectivity. Discrete Math. 2005;304:128–134. doi: https://doi.org/10.1016/j.disc.2005.04.020
- Ou JP. Edge cuts leaving components of order at least m. Discrete Math. 2005;305:365–371. doi: https://doi.org/10.1016/j.disc.2005.10.012
- Ou JP. A bound on 4-restricted edge connectivity of graphs. Discrete Math. 2007;307:2429–2437. doi: https://doi.org/10.1016/j.disc.2006.10.016
- Shang L, Zhang H. A general sufficient condition for a graph G with λm(G)≤ξm(G). Science China Math. 2010;53:1039–1044. doi: https://doi.org/10.1007/s11425-009-0179-3
- Balbuena C, Marcote X. The k-restricted edge-connectivity of a product of graphs. Discrete Appl Math. 2013;161:52–59. doi: https://doi.org/10.1016/j.dam.2012.08.001
- Holtkampa A, Meierling D, Montejano LP. k-restricted edge-connectivity in triangle-free graphs. Discrete Appl Math. 2012;160:1345–1355. doi: https://doi.org/10.1016/j.dam.2012.01.022
- Ou JP. On maximal 3-restricted edge connectivity of regular graphs. Int J Comput Math. 2010;87:3149–3156. doi: https://doi.org/10.1080/00207160903165416
- Wang M, Lin Y. Sufficient conditions for graphs to be maximally 4-restricted edge connected. Australas J Combin. 2018;70(1):123–136.
- Wang S. A sufficient condition for graphs to be super k-restricted edge connected. Discuss Math Graph Theory. 2017;37:537–545. doi: https://doi.org/10.7151/dmgt.1939
- Wang S, Zhang L. Sufficient conditions for k-restricted edge connected graphs. Theor Comput Sci. 2014;557:66–75. doi: https://doi.org/10.1016/j.tcs.2014.08.018
- Wang S, Zhang L, Lin S. k-restricted edge connectivity in (p+1)-clique-free graphs. Discrete Appl Math. 2015;181:255–259. doi: https://doi.org/10.1016/j.dam.2014.10.008
- Zhang Z. Sufficient conditions for restricted-edge-connectivity to be optimal. Discrete Math. 2007;307:2891–2899. doi: https://doi.org/10.1016/j.disc.2007.01.016
- Turán P. On an extremal problem in graph theory. Mat Fiz Lapok. 1941;48:436–452.
- West DB. Introduction to graph theory. 2nd ed. Upper Saddle River: Prentice Hall Inc.; 2001.
- Hellwig A, Volkmann L. Sufficient conditions for graphs to be λ′-optimal, super-edge-connected and maximally edge-connected. J Graph Theory. 2005;48:228–246. doi: https://doi.org/10.1002/jgt.20053
- Shang L, Zhang H. Degree conditions for graphs to be λ3-optimal and super- λ3. Discrete Math. 2009;309:3336–3345. doi: https://doi.org/10.1016/j.disc.2008.09.051