Circuit partitions and signed interlacement in 4-regular graphs

2016/07/14 by Lorenzo Traldi, Traldi, Lorenzo
Mathematics · #Geometric and Algebraic Topology #Finite Group Theory Research #Homotopy and Cohomology in Algebraic Topology

paper · pdf · doi:10.48550/arxiv.1607.04233

Abstract

Let F be a 4-regular graph. Each circuit partition P of F has a corresponding touch-graph Tch(P); the circuits in P correspond to vertices of Tch(P), and the vertices of F correspond to edges of Tch(P). We discuss the connection between modified versions of the interlacement matrix of an Euler system of F and the cycle space of Tch(P), over GF(2) and ℝ.

Related

• Binary nullity, Euler circuits and interlace polynomials
• On the interlace polynomials
• The Interlace Polynomial of a Graph
• A bracket polynomial for graphs, IV. Undirected Euler circuits, graph-links and multiply marked graphs
• Sorting by Reversals and the Theory of 4-Regular Graphs