|
| |
|
|
A205295
|
|
Number of connected 5-regular simple graphs on 2n vertices with girth at least 5.
|
|
9
|
|
|
|
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 90
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,16
|
|
|
REFERENCES
|
M. Meringer, Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory, 30 (1999), 137-146.
|
|
|
LINKS
|
Table of n, a(n) for n=0..16.
Jason Kimberley, Index of sequences counting connected k-regular simple graphs with girth at least g
M. Meringer, Tables of Regular Graphs
|
|
|
CROSSREFS
|
Connected k-regular simple graphs with girth at least 5: A185115 (k=2), A014372 (k=3), A058343 (k=4), this sequence (k=5).
Connected 5-regular simple graphs with girth at least g: A006821 (g=3), A058275 (g=4), this sequence (g=5).
Connected 5-regular simple graphs with girth exactly g: A184953 (g=3), A184954 (g=4), A184955 (g=5).
Sequence in context: A220318 A220341 A184955 * A218385 A067767 A202918
Adjacent sequences: A205292 A205293 A205294 * A205296 A205297 A205298
|
|
|
KEYWORD
|
nonn,more,hard
|
|
|
AUTHOR
|
Jason Kimberley, Jan 25 2012
|
|
|
STATUS
|
approved
|
| |
|
|
