On the linear algebra of local complementation
From MaRDI portal
Publication:665929
DOI10.1016/j.laa.2011.06.048zbMath1236.05107arXiv1101.1246OpenAlexW1986238925MaRDI QIDQ665929
Publication date: 7 March 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.1246
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
The adjacency matroid of a graph ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Isotropic matroids. II: Circle graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-variable interlace polynomial
- Maximal pivots on graphs with an application to gene assembly
- The group structure of pivot and loop complementation on graphs and set systems
- The interlace polynomial of a graph
- Chords in a circle and linear algebra over GF(2)
- A characterization of circle graphs
- Graph polynomials from principal pivoting
- Circle graphs and the cycle double cover conjecture
- Unimodularity and circle graphs
- Reducing prime graphs and recognizing circle graphs
- Eulerian graphs and related topics. Part 1, Volume 1
- Eulerian graphs and related topics. Part 1, Volume 2
- Cycle decomposition by disjoint transpositions
- Cycle decomposition by transpositions
- Multimatroids. IV: Chain-group representations
- Circle graph obstructions
- On a formula for the number of Euler trails for a class of digraphs
- Multimatroids. II: Orthogonality, minors and connectivity
- A few weight systems arising from intersection graphs
- On the product of certain permutations
- The interlace polynomial of graphs at \(-1\)
- A matrix for computing the Jones polynomial of a knot
- An alternative formula for the number of Euler trails for a class of digraphs
- On the interlace polynomials
- Principal pivot transforms: Properties and applications
- Binary nullity, Euler circuits and interlace polynomials
- Nullity invariance for pivot and the interlace polynomial
- AN EQUIVALENCE BETWEEN THE SET OF GRAPH-KNOTS AND THE SET OF HOMOTOPY CLASSES OF LOOPED GRAPHS
- Le Polynôme De Martin D'un Graphe Eulerien
- Walks through every edge exactly twice
- Multimatroids I. Coverings by Independent Sets
- On the number of Euler trails in directed graphs
- VASSILIEV KNOT INVARIANTS COMING FROM LIE ALGEBRAS AND 4-INVARIANTS
- Walks through every edge exactly twice II
- Multimatroids. III: Tightness and fundamental graphs
This page was built for publication: On the linear algebra of local complementation
