|
Search: id:A129585
|
|
|
| A129585 |
|
Number of labeled connected bi-point-determining graphs (see A129583). |
|
+0
5
|
|
| 1, 0, 0, 12, 252, 12312, 1061304, 170176656, 51134075424, 29204599254624, 32130964585236096, 68873851786953047040, 290164895151435531345024, 2417786648013402212500060416, 40014055814155246577685250570752
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
The calculation of connected bi-point-determining graphs is carried out by examining the connected components of bi-point-determining graphs. For more details, see reference.
|
|
REFERENCES
|
I. Gessel and J. Li, On Point-Determining Graphs, arXiv:0705.0042
|
|
LINKS
|
Ira Gessel, Ji Li, On Point-Determining Graphs, arXiv:0705.0042
|
|
FORMULA
|
E.g.f.: x+ln(Sum(2^binomial(n,2)*(2*ln(1+x)-x)^n/n!,n=0..infinity)/(1+x)). - Goran Kilibarda, Vladeta Jovovic (vladeta(AT)eunet.rs), May 09 2007
|
|
CROSSREFS
|
Cf. graphs: labeled A006125, unlabeled A000568; connected graphs: labeled A001187, unlabeled A001349; point-determining graphs: labeled A006024, unlabeled A004110; connected point-determining graphs: labeled A092430, unlabeled A004108; connected co-point-determining graphs: labeled A079306, unlabeled A004108; bi-point-determining graphs: labeled A129583, unlabeled A129584; connected bi-point-determining graphs: labeled A129585, unlabeled A129586; phylogenetic trees: labeled A000311, unlabeled A000669.
Sequence in context: A099139 A035013 A065583 this_sequence A034672 A133285 A113091
Adjacent sequences: A129582 A129583 A129584 this_sequence A129586 A129587 A129588
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Ji Li (vieplivee(AT)hotmail.com), May 07 2007
|
|
EXTENSIONS
|
More terms from Goran Kilibarda, Vladeta Jovovic (vladeta(AT)eunet.rs), May 09 2007
|
|
|
Search completed in 0.002 seconds
|
