Interlace polynomials: enumeration, unimodality and connections to codes
From MaRDI portal
Publication:968188
DOI10.1016/j.dam.2009.11.011zbMath1225.05156arXiv0804.2576WikidataQ60692133 ScholiaQ60692133MaRDI QIDQ968188
Lars Eirik Danielsen, Matthew G. Parker
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.2576
unimodality; quantum codes; local complementation; circle graphs; interlace polynomials; quantum graph states
05C45: Eulerian and Hamiltonian graphs
Related Items
Fast evaluation of interlace polynomials on graphs of bounded treewidth, On graphs and codes preserved by edge local complementation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The interlace polynomial of a graph
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Edge local complementation and equivalence of binary linear codes
- Graphic presentations of isotropic systems
- Local complementation and interlacement graphs
- Circle graph obstructions
- The coefficients of the Tutte polynomial are not unimodal
- Interlace polynomials
- Euler circuits and DNA sequencing by hybridization
- The interlace polynomial of graphs at \(-1\)
- Graph-based classification of self-dual additive codes over finite fields
- Aperiodic propagation criteria for Boolean functions
- Multiparty entanglement in graph states
- Generalized Bent Criteria for Boolean Functions (I)
- Recognition of Circle Graphs
- Quantum error correction via codes over GF(4)
- Univariate and Multivariate Merit Factors
- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
- Coding and Cryptography
