|
Search: id:A165628
|
|
|
| A165628 |
|
Number of 7-regular graphs (septic graphs) on 2n vertices. |
|
+0
9
|
| |
|
|
OFFSET
|
4,2
|
|
|
COMMENT
|
Because the triangle A051031 is symmetric, a(n) is also the number of (2n-8)-regular graphs on 2n 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 A014377.
|
|
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: A062598 A145694 A014377 this_sequence A119747 A127106 A165877
Adjacent sequences: A165625 A165626 A165627 this_sequence A165629 A165630 A165631
|
|
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.003 seconds
|
