Gabrielle Tauscheck - cp's OEIS frontend

User: Gabrielle Tauscheck

Gabrielle Tauscheck has authored 2 sequences.

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

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

Offset: 1

Gabrielle Tauscheck, Apr 02 2024

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.

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

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

Cf. A349402.

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

Gabrielle Tauscheck, Nov 15 2021

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.

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

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

Cf. A004108.

cp's OEIS Frontend

User: Gabrielle Tauscheck

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs