The minimum number of edges and vertices in a graph with edge connectivity $n$ and $m$ $n$-bonds
HTML articles powered by AMS MathViewer
- by Robert E. Bixby PDF
- Bull. Amer. Math. Soc. 80 (1974), 700-704
References
- D. R. Fulkerson and L. S. Shapley, Minimal $k$-arc connected graphs, Networks 1 (1971/72), 91–98. MR 295958, DOI 10.1002/net.3230010108
- Frank Harary, The maximum connectivity of a graph, Proc. Nat. Acad. Sci. U.S.A. 48 (1962), 1142–1146. MR 137663, DOI 10.1073/pnas.48.7.1142
- G. Katona, A theorem of finite sets, Theory of graphs (Proc. Colloq., Tihany, 1966) Academic Press, New York, 1968, pp. 187–207. MR 0290982
- Joseph B. Kruskal, The number of simplices in a complex, Mathematical optimization techniques, Univ. California Press, Berkeley, Calif., 1963, pp. 251–278. MR 0154827
- W. T. Tutte, Connectivity in graphs, Mathematical Expositions, No. 15, University of Toronto Press, Toronto, Ont.; Oxford University Press, London, 1966. MR 0210617, DOI 10.3138/9781487584863
- W. T. Tutte, Lectures on matroids, J. Res. Nat. Bur. Standards Sect. B 69B (1965), 1–47. MR 179781, DOI 10.6028/jres.069B.001
- R. Van Slyke and H. Frank, Network reliability analysis. I, Networks 1 (1971/72), 279–290. MR 295838, DOI 10.1002/net.3230010307
Additional Information
- Journal: Bull. Amer. Math. Soc. 80 (1974), 700-704
- MSC (1970): Primary 05C99, 94A20
- DOI: https://doi.org/10.1090/S0002-9904-1974-13557-3
- MathSciNet review: 0392668