|
|
A349402
|
|
Number of distance-critical graphs on n vertices.
|
|
2
|
|
|
0, 0, 0, 0, 1, 1, 4, 15, 168, 2252, 94504
(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.
|
|
LINKS
|
|
|
EXAMPLE
|
The unique distance-critical graphs on 5 and 6 vertices are the cycles.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|