|
|
A014387
|
|
Number of connected regular bipartite graphs of degree 7 with 2n nodes.
|
|
1
|
|
|
1, 1, 8, 725, 2806508, 27033154065, 376962851057235, 7292080848843162283, 192271946945501178473766, 6811960423672201527406129366, 320020341797819074616734725607588, 19688392653216509161510863093984500501
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
7,3
|
|
REFERENCES
|
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.
CRC Handbook of Combinatorial Designs, 1996, p. 648.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Eric Rogoyski, May 15 1997
|
|
STATUS
|
approved
|
|
|
|