|
Search: id:A006820
|
|
|
| A006820 |
|
Number of connected regular graphs of degree 4 (or quartic graphs) with n nodes.
(Formerly M1617)
|
|
+0
17
|
|
| 1, 1, 2, 6, 16, 59, 265, 1544, 10778, 88168, 805491, 8037418, 86221634, 985870522, 11946487647
(list; graph; listen)
|
|
|
OFFSET
|
5,3
|
|
|
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.
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
M. Meringer, Tables of Regular Graphs
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Cf. A033301, A033483.
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: A150029 A068787 A073959 this_sequence A131385 A027742 A033301
Adjacent sequences: A006817 A006818 A006819 this_sequence A006821 A006822 A006823
|
|
KEYWORD
|
nonn,nice,hard,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Appended a(19) from running M. Meringer's GENREG for 79 hours. Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 04 2009
|
|
|
Search completed in 0.002 seconds
|
