Matroids arising from electrical networks
DOI10.1016/j.aam.2022.102331zbMath1486.05038arXiv1809.10100OpenAlexW4214665813MaRDI QIDQ2122763
Publication date: 7 April 2022
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.10100
Graph polynomials (05C31) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Las Vergnas polynomial for embedded graphs
- Quantum integrable model of an arrangement of hyperplanes
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. II: The three matroids
- Precoloring extension. I: Interval graphs
- Biased graphs IV: Geometrical realizations
- Homogeneous multivariate polynomials with the half-plane property
- Geometry of the space of phylogenetic trees
- Matroid inequalities from electrical network theory
- On graphic arrangement groups
- Electrical networks and hyperplane arrangements
- Valid orderings of real hyperplane arrangements
- Polynomials with the half-plane property and matroid theory
- The Bergman complex of a matroid and phylogenetic trees
- Inverse Problem in Cylindrical Electrical Networks
- Arithmetic of Marked Order Polytopes, Monotone Triangle Reciprocity, and Partial Colorings
- The Space of Circular Planar Electrical Networks
- Boundary partitions in trees and dimers
- The cycle space of an embedded graph
- Vertices of Localized Imbalance in a Biased Graph
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Theory of Matroids
This page was built for publication: Matroids arising from electrical networks
