login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156806 Number of distinct interlace polynomials Q of connected graphs of order n. 0
1, 1, 1, 2, 4, 10, 23, 84, 337, 2154, 22956, 486488 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
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
KEYWORD
hard,more,nonn
AUTHOR
Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 17:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)