login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A371674 Number of maximal distance-critical graphs on n vertices. 0
0, 0, 0, 0, 1, 1, 2, 4, 14, 82, 557 (list; graph; refs; listen; history; text; internal format)
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
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 A166894 A232108
KEYWORD
nonn,more
AUTHOR
Gabrielle Tauscheck, Apr 02 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 18:57 EDT 2024. Contains 373689 sequences. (Running on oeis4.)