Cuts and Connectivity

  • W. D. Wallis


Among connected graphs, some are connected so slightly that removal of a single vertex or edge will disconnect them. Such vertices and edges are quite important. A vertex x is called a cutpoint in G if G — x contains more components than G does; in particular if G is connected, then a cutpoint is a vertex x such that G — x is disconnected. Similarly a bridge (or cut-edge) is an edge whose deletion increases the number of components.


Edge Incident Single Vertex Block Graph Pendant Edge Critical Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • W. D. Wallis
    • 1
  1. 1.Department of MathematicsSouthern Illinois UniversityCarbondaleUSA

Personalised recommendations