Minimum 3-geodetically connected graphs (Q1406024)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum 3-geodetically connected graphs |
scientific article |
Statements
Minimum 3-geodetically connected graphs (English)
0 references
9 September 2003
0 references
A graph \(G\) is \(k\)-geodetically connected if it is connected and the removal of at least \(k\) vertices is required to increase the distance between at least one pair of vertices or reduce \(G\) to a single vertex. The author characterizes the class of minimum 3-geodetically connected graphs that have the fewest edges for a given number of vertices.
0 references
distance
0 references
geodeditc connectivity
0 references
