The adjacency matroid of a graph

zbMath1298.05210arXiv1107.5493MaRDI QIDQ396844

Lorenzo Traldi, Hendrik Jan Hoogeboom, Robert Brijder

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

minormatroidTutte polynomialadjacencydelta-matroidinterlace polynomiallocal complement

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

How many delta-matroids are there? ⋮ Recombination faults in gene assembly in ciliates modeled using multimatroids ⋮ Binary matroids and local complementation ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Isotropic matroids. I: Multimatroids and neighborhoods ⋮ 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
• Unnamed Item
• Unnamed Item
• Interlace polynomials for multimatroids and delta-matroids
• A two-variable interlace polynomial
• The group structure of pivot and loop complementation on graphs and set systems
• On the linear algebra of local complementation
• The interlace polynomial of a graph
• Graphes de cordes et espaces graphiques
• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• Isotropic systems
• Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
• A generalization of Tutte's characterization of totally unimodular matrices
• Interlace polynomials
• The interlace polynomial of graphs at \(-1\)
• On the interlace polynomials
• Binary nullity, Euler circuits and interlace polynomials
• Weighted Interlace Polynomials
• Structural Analysis of Complex Networks
• Symmetric Representations of Binary Matroids
• On the Principal Edge Tripartition of a Graph
• Coverings and delta-coverings
• Nullity and Loop Complementation for Delta-Matroids
• Distance Hereditary Graphs and the Interlace Polynomial
• Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
• Flots et tensions dans un graphe
• Theory of Matroids

This page was built for publication: The adjacency matroid of a graph