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

Cited In (27)

On vector spaces associated with a graph
A Proof of Tuite’s Trinity Theorem and a New Determinant Formula
Balanced vertex weightings and arborescences
Ranking edges by their impact on the spectral complexity of information diffusion over networks
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
Laplacian matrices of graphs: A survey
Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy
Title not available (Why is that?)
Parameterized counting of trees, forests and matroid bases
Determinantal Point Processes Implicitly Regularize Semiparametric Regression Problems
Parameterized counting of partially injective homomorphisms
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
GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY
Determinantal probability measures on Grassmannians
Bayesian analysis for reversible Markov chains
Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
New inconsistency indicators for incomplete pairwise comparisons matrices
Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
Unimodular equivalence of graphs
Bicycles and Spanning Trees
Generalized bicycles
Invariant differential forms on complexes of graphs and Feynman integrals
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)