A371674 Number of maximal distance-critical graphs on n vertices.

0, 0, 0, 0, 1, 1, 2, 4, 14, 82, 557

Offset

1,7

Comments

A distance-critical graph is considered to be a connected graph such that no vertex can be deleted without altering the distance metric on the remaining vertices. A maximal distance-critical graph is considered to be a distance critical graph such that the addition of any edge or edges will no longer result in a distance critical graph.

Links

Table of n, a(n) for n=1..11.

Joshua Cooper and Gabrielle Tauscheck, Distance Critical Graphs, arXiv:2405.09656 [math.CO], 2024. See p. 10.

Example

The unique maximal distance-critical graphs on 5 and 6 vertices are the cycles.

Crossrefs

Cf. A349402.

Sequence in context: A052856 A093462 A302136 * A181080 A375630 A166894

Adjacent sequences: A371671 A371672 A371673 * A371675 A371676 A371677

Keyword

nonn,more

Author

Gabrielle Tauscheck, Apr 02 2024

Status

approved