login
Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a diamond, where a diamond is the graph on four vertices formed by removing an edge from the complete graph K4.
0

%I #11 Jan 14 2016 16:31:49

%S 1,1,2,5,13,46,194,1138,8973,101496,1647556,38368079,1264177225

%N Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a diamond, where a diamond is the graph on four vertices formed by removing an edge from the complete graph K4.

%H A. Brandstadt, <a href="http://dx.doi.org/10.1016/S0166-218X(03)00266-X">(P5,diamond)-free graphs Revisited: Structure and Linear Time optimization</a>, in Optimal discrete structures and algorithms (ODSA 2000). Discrete Appl. Math. 138 (2004), 13-27.

%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 39d0919

%K more,nonn

%O 1,3

%A _Jim Nastos_, Jan 24 2003

%E a(10)-a(13) added using tinygraph by _Falk Hüffner_, Jan 14 2016