

A371674


Number of maximal distancecritical 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 distancecritical 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 distancecritical 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



EXAMPLE

The unique maximal distancecritical graphs on 5 and 6 vertices are the cycles.


CROSSREFS



KEYWORD

nonn,more


AUTHOR



STATUS

approved



