|
|
A014385
|
|
Number of connected regular bipartite graphs of degree 6 with 2n nodes.
|
|
1
|
|
|
1, 1, 7, 157, 62616, 78322916, 147252447227, 376962851057234, 1280344203366849969, 5666901233595672365908, 32193489258177947645878365, 231605871969834571512497704231, 2084558172807256752718977250960988
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
6,3
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Eric Rogoyski, May 15 1997
|
|
STATUS
|
approved
|
|
|
|