Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs

DOI10.1137/0130017MaRDI QIDQ4138747zbMATH OpenOpenAlexWikidataFDO

Authors Stephen B. Maurer

Publication date 1976

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b1593060656672b4a706a804301c7a866db8b3b1

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited in

(28)

• Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
• On vector spaces associated with a graph
• A Proof of Tuite’s Trinity Theorem and a New Determinant Formula
• Balanced vertex weightings and arborescences
• Planarity via spanning tree number: a linear-algebraic criterion
• Ranking edges by their impact on the spectral complexity of information diffusion over networks
• Laplacian matrices of graphs: A survey
• Parameterized counting of trees, forests and matroid bases
• Parameterized counting of partially injective homomorphisms
• Determinantal Point Processes Implicitly Regularize Semiparametric Regression Problems
• Determinantal probability measures
• Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
• Matchings and spanning trees in boolean weighted graphs
• Approximately counting bases of bicircular matroids
• Determinantal probability measures on Grassmannians
• Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
• Bayesian analysis for reversible Markov chains
• Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
• New inconsistency indicators for incomplete pairwise comparisons matrices
• Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
• Unimodular equivalence of graphs
• Generalized bicycles
• Bicycles and Spanning Trees
• Invariant differential forms on complexes of graphs and Feynman integrals
• On the mean projection theorem for determinantal point processes
• Network-ensemble comparisons with stochastic rewiring and von Neumann entropy
• A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean
• A Combinatorial Proof of the All Minors Matrix Tree Theorem

This page was built for publication: Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs

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