|
|
A014375
|
|
Number of trivalent connected simple graphs with 2n nodes and girth at least 7.
|
|
18
|
|
|
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3, 21, 546, 30368, 1782840, 95079083, 4686063120, 220323447962, 10090653722861
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,14
|
|
COMMENTS
|
The null graph on 0 vertices is vacuously connected and 3-regular; since it is acyclic, it has infinite girth. [Jason Kimberley, Jan 29 2011]
|
|
REFERENCES
|
CRC Handbook of Combinatorial Designs, 1996, p. 647.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
Connected k-regular simple graphs with girth at least 7: A186727 (any k), A186717 (triangle); specific k: A185117 (k=2), this sequence (k=3).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Terms a(17), a(18), and a(19) found by running Meringer's GENREG for 1.9 hours, 99.6 hours, and 207.8 processor days, at U. Ncle., by Jason Kimberley, May 29 2010
Terms a(20) and a(21) from House of Graphs via Jason Kimberley, May 21 2017
|
|
STATUS
|
approved
|
|
|
|