A330333 Number of diameter-2-critical graphs with n nodes.

1, 2, 3, 5, 10, 30, 103, 519

Offset

3,2

Comments

The first 10 terms were obtained by filtering the list of non-isomorphic connected graphs, see McKay et al., 2013.

Links

Table of n, a(n) for n=3..10.

J. A. MacDougall and R. B. Eggleton, Triangle-free and triangle-saturated Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 25:3-21, 1997.

B. D. McKay and A. Piperno, Practical Graph Isomorphism, II, J. Symbolic Computation 60 (2013), 94-112.

Example

The diameter-2-critical graphs for n=3,4,5 are K_{1,2}; K_{1,3}, C_4; K_{1,4}, K_{2,3}, C_5.

Crossrefs

Sequence in context: A259878 A003504 A213169 * A003182 A348260 A363257

Adjacent sequences: A330330 A330331 A330332 * A330334 A330335 A330336

Keyword

nonn,more

Author

Miodrag Zivkovic, Dec 17 2019

Status

approved