|
|
A184991
|
|
Irregular triangle C(n,g) counting the connected 9-regular simple graphs on 2n vertices with girth at least g.
|
|
1
|
|
|
|
OFFSET
|
5,2
|
|
COMMENTS
|
The first column is for girth at least 3. The row length is incremented to g-2 when 2n reaches A054760(9,g).
|
|
LINKS
|
|
|
EXAMPLE
|
1;
9;
88193;
113314233813;
?, 1;
?, 1;
?, 14;
|
|
CROSSREFS
|
Connected 9-regular simple graphs with girth at least g: this sequence (triangle); chosen g: A014381 (g=3), A181170 (g=4).
Connected 9-regular simple graphs with girth exactly g: A184990 (triangle); chosen g: A184983 (g=3).
Triangular arrays C(n,g) counting connected simple k-regular graphs on n vertices with girth at least g: A185131 (k=3), A184941 (k=4), A184951 (k=5), A184961 (k=6), A184971 (k=7), A184981 (k=8), this sequence (k=9).
|
|
KEYWORD
|
nonn,hard,more,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|