|
%I #16 Jun 17 2022 16:32:36
%S 1,0,0,1,5,31,293,4986,151096,8264613
%N Number of unlabeled connected bi-point-determining graphs (see A129583).
%C The calculation of the number of connected bi-point-determining graphs is carried out by examining the connected components of bi-point-determining graphs. For more details, see linked paper "Enumeration of point-determining Graphs".
%H Ira M. Gessel and Ji Li, <a href="https://doi.org/10.1016/j.jcta.2010.03.009">Enumeration of point-determining Graphs</a>, Journal of Combinatorial Theory, Series A 118 (2011) 591-612.
%Y 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.
%K nice,nonn,more
%O 1,5
%A Ji Li (vieplivee(AT)hotmail.com), May 07 2007
%E 151096 and 8264613 from _Vladeta Jovovic_, May 10 2007
|
