|
Search: id:A156805
|
|
|
| A156805 |
|
Number of distinct interlace polynomials q of graphs of order n |
|
+0
1
|
|
| 1, 2, 4, 8, 17, 41, 112, 369, 1555, 8625, 65323, 680275
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
M. Aigner and H. van der Holst, Interlace polynomials, Linear Algebra Appl., 377 (2004), 11-30.
|
|
LINKS
|
L. E. Danielsen and M. G. Parker, Interlace polynomials: Enumeration, unimodality, and connections to codes, Preprint, 2008.
R. Arratia, B. Bollobas, and G. B. Sorkin, The Interlace Polynomial of a Graph, J. Combin. Theory Ser. B, 92 (2004), 199-233.
|
|
CROSSREFS
|
Sequence in context: A137856 A090375 A104879 this_sequence A113153 A171719 A092507
Adjacent sequences: A156802 A156803 A156804 this_sequence A156806 A156807 A156808
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009
|
|
|
Search completed in 0.002 seconds
|
