|
Search: id:A014377
|
|
|
| A014377 |
|
Number of connected regular graphs of degree 7 with 2n nodes. |
|
+0
13
|
| |
|
|
OFFSET
|
4,2
|
|
|
REFERENCES
|
CRC Handbook of Combinatorial Designs, 1996, p. 648.
I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Probl\`{e}mes combinatoires et th\'{e}orie des graphes (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, Centre Nat. Recherche Scient., Paris, 1978.
|
|
LINKS
|
M. Meringer, Tables of Regular Graphs
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Connected regular graphs of degree k: A002851 (k=3), A006820 (k=4), A006821 (k=5), A006822 (k=6), A014377 (k=7), A014378 (k=8), A014381 (k=9), A014382 (k=10), A014384 (k=11).
Sequence in context: A096725 A062598 A145694 this_sequence A165628 A119747 A127106
Adjacent sequences: A014374 A014375 A014376 this_sequence A014378 A014379 A014380
|
|
KEYWORD
|
nonn,nice,hard,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Added another term from <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">Meringer's page</a> Dmitry Kamenetsky (dkamen(AT)rsise.anu.edu.au), Jul 28 2009
Term a(16) was computed by running Meringer's GENREG for 325 processor days on ARCSgrid at UNcle. Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Oct 02 2009
|
|
|
Search completed in 0.002 seconds
|
