A243250 Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a diamond graph.

0, 0, 0, 2, 10, 73, 688, 10150, 253396, 11629559

Offset: 1

Author

Travis Hoppe and Anna Petrone, Jun 01 2014

Keywords

• nonn
• more

Links

• Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
• T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014
• Eric Weisstein's World of Mathematics, Diamond Graph

Formula

a(n) = A001349(n) - A242790(n).