Binary nullity, Euler circuits and interlace polynomials
From MaRDI portal
Publication:2275481
Abstract: A theorem of Cohn and Lempel [J. Combin. Theory Ser. A 13 (1972), 83-89] gives an equality relating the number of circuits in a directed circuit partition of a 2-in, 2-out digraph to the GF(2)-nullity of an associated matrix. This equality is essentially equivalent to the relationship between directed circuit partitions of 2-in, 2-out digraphs and vertex-nullity interlace polynomials of interlace graphs. We present an extension of the Cohn-Lempel equality that describes arbitrary circuit partitions in (undirected) 4-regular graphs. The extended equality incorporates topological results that have been of use in knot theory, and it implies that if H is obtained from an interlace graph by attaching loops at some vertices then the vertex-nullity interlace polynomial is essentially the generating function for certain circuit partitions of an associated 4-regular graph.
Recommendations
Cites work
- scientific article; zbMATH DE number 4214039 (Why is no real title available?)
- scientific article; zbMATH DE number 3981410 (Why is no real title available?)
- scientific article; zbMATH DE number 3606473 (Why is no real title available?)
- scientific article; zbMATH DE number 1933265 (Why is no real title available?)
- scientific article; zbMATH DE number 1445310 (Why is no real title available?)
- scientific article; zbMATH DE number 3257167 (Why is no real title available?)
- scientific article; zbMATH DE number 4183450 (Why is no real title available?)
- A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
- A bracket polynomial for graphs. I
- A few weight systems arising from intersection graphs
- A matrix for computing the Jones polynomial of a knot
- A multivariate interlace polynomial and its computation for graphs of bounded clique-width
- A two-variable interlace polynomial
- An alternative formula for the number of Euler trails for a class of digraphs
- Chords in a circle and linear algebra over GF(2)
- Cycle decomposition by disjoint transpositions
- Cycle decomposition by transpositions
- INTRODUCTION TO GRAPH-LINK THEORY
- Interlace polynomials
- On a formula for the number of Euler trails for a class of digraphs
- On the number of Euler trails in directed graphs
- On the product of certain permutations
- The interlace polynomial of a graph
- VASSILIEV KNOT INVARIANTS COMING FROM LIE ALGEBRAS AND 4-INVARIANTS
- Virtual knot theory
- \(J\)-invariants of plane curves and framed chord diagrams
Cited in
(14)- The adjacency matroid of a graph
- A parity map of framed chord diagrams
- Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
- On the linear algebra of local complementation
- Graph-links: nonrealizability, orientation, and Jones polynomial
- Parity in knot theory and graph-links
- On the interlace polynomials
- A bracket polynomial for graphs. IV: Undirected Euler circuits, graph-links and multiply marked graphs
- Fast evaluation of interlace polynomials on graphs of bounded treewidth
- Nullity invariance for pivot and the interlace polynomial
- The transition matroid of a 4-regular graph: an introduction
- Sorting by reversals and the theory of 4-regular graphs
- Nullity-based matroid of rough sets and its application to attribute reduction
- Matroids, delta-matroids and embedded graphs
This page was built for publication: Binary nullity, Euler circuits and interlace polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275481)
