cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A349402 Number of distance-critical graphs on n vertices.

Original entry on oeis.org

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

Views

Author

Gabrielle Tauscheck, Nov 15 2021

Keywords

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.

Examples

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

Crossrefs

Cf. A004108.