%I #14 May 20 2024 11:46:23
%S 0,0,0,0,1,1,2,4,14,82,557
%N Number of maximal distance-critical graphs on n vertices.
%C 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.
%H Joshua Cooper and Gabrielle Tauscheck, <a href="https://arxiv.org/abs/2405.09656">Distance Critical Graphs</a>, arXiv:2405.09656 [math.CO], 2024. See p. 10.
%e The unique maximal distance-critical graphs on 5 and 6 vertices are the cycles.
%Y Cf. A349402.
%K nonn,more
%O 1,7
%A _Gabrielle Tauscheck_, Apr 02 2024