cut vertex

Show Summary Details

Quick Reference

Of a connected graph G. A vertex of G whose removal together with the removal of all edges incident to it results in the remaining graph being disconnected. The term can also be extended and applied to more general graphs. Then the removal of a cut vertex and all arcs incident to it increases the number of connected components of the graph. See also connectivity.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.