|
Search: id:A006822
|
|
|
| A006822 |
|
Number of connected regular graphs of degree 6 with n nodes.
(Formerly M3579)
|
|
+0
11
|
| |
|
|
OFFSET
|
7,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.
|
|
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).
Adjacent sequences: A006819 A006820 A006821 this_sequence A006823 A006824 A006825
Sequence in context: A041667 A132684 A032074 this_sequence A126458 A048164 A118909
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
