A156806 Number of distinct interlace polynomials Q of connected graphs of order n.

1, 1, 1, 2, 4, 10, 23, 84, 337, 2154, 22956, 486488

Offset

1,4

Links

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

M. Aigner and H. van der Holst, Interlace polynomials, Linear Algebra Appl., 377 (2004), 11-30.

R. Arratia, B. Bollobas, and G. B. Sorkin, The Interlace Polynomial of a Graph, J. Combin. Theory Ser. B, 92 (2004), 199-233.

L. E. Danielsen and M. G. Parker, Interlace polynomials: Enumeration, unimodality, and connections to codes, arXiv:0804.2576 [math.CO], 2008-2009.

Crossrefs

Sequence in context: A337179 A130967 A148087 * A192523 A065832 A072753

Adjacent sequences: A156803 A156804 A156805 * A156807 A156808 A156809

Keyword

hard,more,nonn

Author

Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009

Status

approved