|
Search: id:A165627
|
|
|
| A165627 |
|
Number of 6-regular graphs (sextic graphs) on n vertices. |
|
+0
9
|
|
| 1, 1, 4, 21, 266, 7849, 367860, 21609301, 1470293676, 113314233813
(list; graph; listen)
|
|
|
OFFSET
|
7,3
|
|
|
COMMENT
|
Because the triangle A051031 is symmetric, a(n) is also the number of (n-7)-regular graphs on n vertices.
|
|
REFERENCES
|
M. Meringer, Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory, 30 (1999), 137-146.
|
|
LINKS
|
M. Meringer, Tables of Regular Graphs
N. J. A. Sloane, Transforms
|
|
FORMULA
|
Euler transformation of A006822.
|
|
CROSSREFS
|
Regular graphs A005176 (any degree), A051031 (triangular array), chosen degrees: A000012 (k=0), A059841 (k=1), A008483 (k=2), A005638 (k=3), A033301 (k=4), A165626 (k=5), A165627 (k=6), A165628 (k=7).
Sequence in context: A132684 A032074 A006822 this_sequence A126458 A048164 A118909
Adjacent sequences: A165624 A165625 A165626 this_sequence A165628 A165629 A165630
|
|
KEYWORD
|
nonn,hard,more,new
|
|
AUTHOR
|
Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 22 2009
|
|
EXTENSIONS
|
Cross-references edited by Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Nov 07 2009
|
|
|
Search completed in 0.002 seconds
|
