A366224 Number of unlabeled 3-connected graphs on n vertices with girth at least 5.

1, 0, 2, 4, 23, 149, 1670, 23882, 422194, 8544496, 195291551

Offset

10,3

Links

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

Example

The smallest such graph is the Petersen graph on 10 vertices.

Crossrefs

Cf. A006290, A140440 (2-connected graphs with girth at least 5),

A366225 (3-connected graphs with girth at least 6).

Sequence in context: A203103 A308164 A173352 * A009313 A009317 A209024

Adjacent sequences: A366221 A366222 A366223 * A366225 A366226 A366227

Keyword

nonn,hard,more

Author

Brendan McKay, Oct 05 2023

Status

approved