cp's OEIS Frontend

A129586 Number of unlabeled connected bi-point-determining graphs (see A129583).

%I A129586 #28 May 12 2025 12:03:12
%S A129586 1,0,0,1,5,31,293,4986,151096,8264613,812528493,144251345591,
%T A129586 46649058611515,27744159658789435,30603223477819571330,
%U A129586 63039669933956074333128,243839768084859914114367906,1779006737976575676931317142360,24571827603944282248499044846893618
%N A129586 Number of unlabeled connected bi-point-determining graphs (see A129583).
%C A129586 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 A129586 Martin Rubey, <a href="/A129586/b129586.txt">Table of n, a(n) for n = 1..29</a>
%H A129586 Florian Fürnsinn, Moritz Gangl, and Martin Rubey, <a href="https://arxiv.org/abs/2505.03665">Unexpectedly, a symmetry on unlabeled graphs</a>, arXiv:2505.03665 [math.CO], 2025. See p. 18.
%H A129586 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 A129586 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 A129586 nice,nonn
%O A129586 1,5
%A A129586 Ji Li (vieplivee(AT)hotmail.com), May 07 2007
%E A129586 151096 and 8264613 from _Vladeta Jovovic_, May 10 2007
%E A129586 a(n) for n >= 11 from _Martin Rubey_, May 08 2025