A268522 Connected simple marginal independence graphs (SMIGs) on n nodes having a unique directed acyclic subgraph.

0, 1, 1, 2, 4, 10, 27, 90, 366

Offset: 2

Author

N. J. A. Sloane, Feb 11 2016

Keywords

• nonn
• more

Links

• J. Textor, A. Idelberger, and M. Liskiewicz, Learning from Pairwise Marginal Independencies, arXiv:1508.00280 [cs.AI], 2015.

Crossrefs

Cf. A001349, A007776.