Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices

MaRDI QIDQ5499962zbMATH OpenFDO

Authors L. Traldi

Publication date 5 August 2015

Full work available at URL https://arxiv.org/abs/1204.0482

zbMATH Keywords

Euler system4-regular graphinterlacementcircuit partition

Mathematics Subject Classification ID

Graph polynomials (05C31)

Abstract: Let F be a 4-regular graph with an Euler system C. We introduce a simple way to modify the interlacement matrix of C so that every circuit partition P of F has an associated modified interlacement matrix M(C,P). If C and C' are Euler systems of F then M(C,C') and M(C',C) are inverses, and for any circuit partition P, M(C',P)=M(C',C)M(C,P). This machinery allows for short proofs of several results regarding the linear algebra of interlacement.

Recommendations

• Binary nullity, Euler circuits and interlace polynomials
• On the interlace polynomials
• Publication:4952623
• The interlace polynomial of a graph
• Framed 4-graphs: Euler tours, Gauss circuits and rotating circuits

Cited in

(5)

• The adjacency matroid of a graph
• A characterization of circle graphs in terms of multimatroid representations
• Isotropic matroids. II: Circle graphs
• Binary matroids and local complementation
• The transition matroid of a 4-regular graph: an introduction

This page was built for publication: Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5499962)