A079573 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.

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

Offset

1,3

Links

Table of n, a(n) for n=1..13.

A. Brandstadt, (P5,diamond)-free graphs Revisited: Structure and Linear Time optimization, in Optimal discrete structures and algorithms (ODSA 2000). Discrete Appl. Math. 138 (2004), 13-27.

F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 39d0919

Crossrefs

Sequence in context: A085632 A378584 A111563 * A360513 A194635 A212821

Adjacent sequences: A079570 A079571 A079572 * A079574 A079575 A079576

Keyword

more,nonn

Author

Jim Nastos, Jan 24 2003

Extensions

a(10)-a(13) added using tinygraph by Falk Hüffner, Jan 14 2016

Status

approved