Search: id:A014382
Results 1-1 of 1 results found.

%I A014382
%S A014382 1,1,10,540,805579,2585136741
%N A014382 Number of connected regular graphs of degree 10 with n nodes.
%C A014382 Since the 10-regular graph with the least number of vertices is K_11, 
               there are no disconnected 10-regular graphs with less than 22 vertices. 
               Thus for n<22 this sequence also counts the number of all 10-regular 
               graphs on n vertices. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), 
               Sep 25 2009]
%D A014382 CRC Handbook of Combinatorial Designs, 1996, p. 648.
%D A014382 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.
%H A014382 M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">
               Tables of Regular Graphs</a>
%H A014382 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               RegularGraph.html">Link to a section of The World of Mathematics.</
               a>
%Y A014382 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).
%Y A014382 Sequence in context: A042209 A163703 A003399 this_sequence A035308 A006441 
               A042751
%Y A014382 Adjacent sequences: A014379 A014380 A014381 this_sequence A014383 A014384 
               A014385
%K A014382 nonn,hard,more
%O A014382 11,3
%A A014382 N. J. A. Sloane (njas(AT)research.att.com).
%E A014382 a(16) from Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 
               25 2009

Search completed in 0.001 seconds