Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-27T21:55:34.848Z Has data issue: false hasContentIssue false
  • English
  • Français

The connectivity function of a graph

Published online by Cambridge University Press:  26 February 2010

Lowell W. Beineke  and
Frank Harary
Lowell W. Beineke
Affiliation:
Purdue University, Fort Wayne. University of Michigan, Ann Arbor.
Frank Harary
Affiliation:
Purdue University, Fort Wayne. University of Michigan, Ann Arbor.
Get access

Extract

The vertex-connectivity and the edge-connectivity of a graph involve minimum sets of vertices and edges, respectively, whose removal results in a disconnected graph. However, the mixed case of separating sets consisting of both vertices and edges appears to have been overlooked. Such considerations might apply to vulnerability problems, such as that of disrupting a railway network with both tracks and depots being destroyed. Depending on the relative costs, a particular combination of tracks and depots might be optimal for the purpose.

Type
Research Article
Information
Mathematika , Volume 14 , Issue 2 , December 1967 , pp. 197 - 202
Copyright
Copyright © University College London 1967

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Dirac, G. A., “Short proof of Menger's graph theorem”, Mathematika, 13 (1966), 42–44.CrossRefGoogle Scholar
2.Elias, P., Feinstein, A., and Shannon, C. E., “A note on the maximum flow through a network”, IRE Trans. Inform. Theory, 2 (1956), 117–119.CrossRefGoogle Scholar
3.Ford, L. R. Jr. and Fulkerson, D. R., “Maximum flow through a network”, Canad. J. Math., 8 (1956), 399–404.CrossRefGoogle Scholar
4.Menger, K., “Zur allgemeinen Kurventheorie”, Fund. Math., 10 (1927), 96–115.CrossRefGoogle Scholar