|
|
A260813
|
|
Number of trivalent bipartite connected simple graphs with 2n nodes and girth at least 8.
|
|
1
|
|
|
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 3, 10, 101, 2510, 79605, 2607595, 81716416, 2472710752
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,19
|
|
COMMENTS
|
The null graph on 0 vertices is vacuously connected, 3-regular, and bipartite; since it is acyclic, it has infinite girth.
|
|
LINKS
|
|
|
CROSSREFS
|
Connected bipartite trivalent simple graphs with girth at least g: A006823 (g=4), A260811 (g=6), this sequence (g=8).
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(23)-a(24) from the House-of-Graphs added by R. J. Mathar, Sep 29 2017
|
|
STATUS
|
approved
|
|
|
|