(definition)
Definition: A vertex whose deletion along with incident edges results in a graph with more components than the original graph.
Also known as articulation point.
See also connected components, biconnected graph.
Note: After Algorithms and Theory of Computation Handbook, page 6-6, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
With input from Paul Tanenbaum <pjt@arl.army.mil> (3 Sept 2002).
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:27:56 2004.
HTML page formatted Wed Oct 26 09:47:24 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "cut vertex", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/cutvertex.html
