Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph Theory Concept
|
| gptkbp:alsoKnownAs |
Articulation Point
|
| gptkbp:appliesTo |
gptkb:Undirected_Graph
|
| gptkbp:compatibleWith |
Directed Graph (in general)
|
| gptkbp:definedIn |
gptkb:Graph_Theory
|
| gptkbp:defines |
A vertex whose removal increases the number of connected components of a graph.
|
| gptkbp:example |
In a star graph, the center is a cut vertex.
|
| https://www.w3.org/2000/01/rdf-schema#label |
Cut Vertex
|
| gptkbp:property |
A graph with no cut vertices is called 2-connected.
A tree with more than two vertices always has at least one cut vertex. |
| gptkbp:relatedTo |
gptkb:Bridge_(Graph_Theory)
Block (Graph Theory) |
| gptkbp:supportsAlgorithm |
Can be found using Depth-First Search (DFS) in linear time.
|
| gptkbp:usedIn |
Network Reliability
Connectivity Analysis Decomposition of Graphs |
| gptkbp:bfsParent |
gptkb:Connected_Undirected_Graph
|
| gptkbp:bfsLayer |
7
|