Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-29T00:06:39.130Z Has data issue: false hasContentIssue false
  • English
  • Français

Dense Subgraphs and Connectivity

Published online by Cambridge University Press:  20 November 2018

R. E. Nettleton ,
K. Goldberg  and
M. S. Green
R. E. Nettleton
Affiliation:
National Bureau of Standards Washington, D.C.
K. Goldberg
Affiliation:
National Bureau of Standards Washington, D.C.
M. S. Green
Affiliation:
National Bureau of Standards Washington, D.C.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A proper subgraph of a connected linear graph is said to disconnect the graph if removing it leaves a disconnected graph. In this paper we characterize, in the following sense, the disconnecting subgraphs of a fixed connected graph. We define two distinct types of disconnecting subgraphs (isthmuses and articulators) which are minimal in the sense that no proper subgraph of either type can disconnect the graph. We then show that any disconnecting subgraph must contain either an isthmus or an articulator. We also define a set of subgraphs (called dense) which form a lattice. We show that the union of the minimal dense subgraphs contains all isthmuses and articulators. In terms of these subgraphs we investigate some of the consequences of assuming that a disconnecting subgraph must contain at least m points.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 11 , 1959 , pp. 262 - 268
Copyright
Copyright © Canadian Mathematical Society 1959

References

1. Harary, F. and Norman, R. Z., The dissimilarity characteristic of Husimi trees, Ann. Math. 58 (1953), pp. 134-41.Google Scholar
2. König, D., Théorie der endlichen und unendlichen Graphen (Leipzig, 1936).Google Scholar