A156807 Number of distinct interlace polynomials Q of graphs of order n.

1, 2, 3, 6, 11, 24, 52, 152, 521, 2793, 26178, 515131

Offset

1,2

References

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

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: A192573 A284994 A107113 * A032256 A324765 A208602

Adjacent sequences: A156804 A156805 A156806 * A156808 A156809 A156810

Keyword

hard,more,nonn

Author

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

Status

approved