|
|
A193130
|
|
Numbers of spanning trees of the cocktail party graphs.
|
|
4
|
|
|
0, 4, 384, 82944, 32768000, 20736000000, 19271206305792, 24759631762948096, 42071440246337175552, 91403961001574400000000, 247248735803801600000000000, 815050629127324260701847945216, 3217014140995401936351315753959424
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Number of trees on 2n labeled vertices containing no edges from a prescribed perfect matching. - Joel B. Lewis, Jun 20 2013
|
|
REFERENCES
|
Dragoš M. Cvetković, Michael Doob, Horst Sachs, Spectra of Graphs: Theory and Application, Academic Press, 1980.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|