Remote Access Bulletin of the American Mathematical Society

Bulletin of the American Mathematical Society

ISSN 1088-9485(online) ISSN 0273-0979(print)



The minimum number of edges and vertices in a graph with edge connectivity $n$ and $m$ $n$-bonds

Author: Robert E. Bixby
Journal: Bull. Amer. Math. Soc. 80 (1974), 700-704
MSC (1970): Primary 05C99, 94A20
MathSciNet review: 0392668
Full-text PDF

References | Similar Articles | Additional Information

References [Enhancements On Off] (What's this?)

  • 1. D. R. Fulkerson and L. S. Shapley, Minimal 𝑘-arc connected graphs, Networks 1 (1971/72), 91–98. MR 0295958
  • 2. Frank Harary, The maximum connectivity of a graph, Proc. Nat. Acad. Sci. U.S.A. 48 (1962), 1142–1146. MR 0137663
  • 3. G. Katona, A theorem of finite sets, Theory of graphs (Proc. Colloq., Tihany, 1966) Academic Press, New York, 1968, pp. 187–207. MR 0290982
  • 4. Joseph B. Kruskal, The number of simplices in a complex, Mathematical optimization techniques, Univ. of California Press, Berkeley, Calif., 1963, pp. 251–278. MR 0154827
  • 5. W. T. Tutte, Connectivity in graphs, Mathematical Expositions, No. 15, University of Toronto Press, Toronto, Ont.; Oxford University Press, London, 1966. MR 0210617
  • 6. W. T. Tutte, Lectures on matroids, J. Res. Nat. Bur. Standards Sect. B 69B (1965), 1–47. MR 0179781
  • 7. R. Van Slyke and H. Frank, Network reliability analysis. I, Networks 1 (1971/72), 279–290. MR 0295838

Similar Articles

Retrieve articles in Bulletin of the American Mathematical Society with MSC (1970): 05C99, 94A20

Retrieve articles in all journals with MSC (1970): 05C99, 94A20

Additional Information