One and two-variable interlace polynomials: A spectral interpretation

13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. By so doing we establish links between graph theory, cryptography, coding theory, and quantum entanglement. We establish the form of the interlace polynomial for certain functions, provide new one and two-variable interlace polynomials, and propose a generalisation of the interlace polynomial to hypergraphs. We also prove conjectures from [15] and equate certain spectral metrics with various evaluations of the interlace polynomial. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Riera, C., & Parker, M. G. (2006). One and two-variable interlace polynomials: A spectral interpretation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3969 LNCS, pp. 397–411). Springer Verlag. https://doi.org/10.1007/11779360_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free