A014382 Number of connected regular graphs of degree 10 with n nodes.
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 10, 540, 805579, 2585136741, 9799685588961, 42700033549946255, 214755319657939505396, 1251392240942040452186675, 8462215143144463851848329660, 66398444413512642732641312352087, 603696608755863722277922645973602843, 6346188247029220928621633703157327186101
Offset: 0
Examples
The null graph on 0 vertices is vacuously connected and 10-regular; since it is acyclic, it has infinite girth. - _Jason Kimberley_, Feb 10 2011
References
- CRC Handbook of Combinatorial Designs, 1996, p. 648.
- I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Problèmes combinatoires et théorie des graphes (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, Centre Nat. Recherche Scient., Paris, 1978.
Links
- Jason Kimberley, Index of sequences counting connected k-regular simple graphs with girth at least g
- M. Meringer, Tables of Regular Graphs
- M. Meringer, Fast Generation of Regular Graphs and Construction of Cages, Journal of Graph Theory, 30 (1999), 137-146.
- Eric Weisstein's World of Mathematics, Regular Graph.
Crossrefs
10-regular simple graphs: this sequence (connected), A185203 (disconnected).
Extensions
Using the symmetry of A051031, a(16) and a(17) from Jason Kimberley, Sep 25 2009 and Jan 03 2011
a(18)-a(21) from Andrew Howroyd, Mar 13 2020
a(22)-a(24) from Andrew Howroyd, May 19 2020
Comments