A349402 Number of distance-critical graphs on n vertices.

0, 0, 0, 0, 1, 1, 4, 15, 168, 2252, 94504

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.

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. 3.

Example

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

Crossrefs

Cf. A004108.

Sequence in context: A197753 A197934 A137654 * A277509 A195569 A118908

Adjacent sequences: A349399 A349400 A349401 * A349403 A349404 A349405

Keyword

nonn,more,changed

Author

Gabrielle Tauscheck, Nov 15 2021

Status

approved