Graph Theory37 sections · 1633 units
Open in Course

Articulation Points - Edge Cases

Single vertex and complete ...

1.1. Single vertex: n=1n=1.

No articulation points (cannot remove the only vertex and have a meaningful result). Output: [][].

2.2. Two vertices, one edge: n=2n=2, edge 010-1.

No articulation points by standard definition. Output: [][].

3.3. Star graph: n=4n=4, edges [[0,1],[0,2],[0,3]][[0,1],[0,2],[0,3]].

Center 00 is an articulation point if n3n \geq 3. Output: [0][0].

4.4. Cycle: no articulation points.

Every vertex has two neighbors. Output: [][].