A Combinatorial Proof of the All Minors Matrix Tree Theorem
From MaRDI portal
Cites work
- Applications of Menger's graph theorem
- Bimatroids and invariants
- Gammoids and transversal matroids
- scientific article; zbMATH DE number 3508526 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3600054 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3047763 (Why is no real title available?)
- Line-digraphs, arborescences and theorems of Tutte and Knuth
- Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
- On a Class of Matroids Arising From Paths in Graphs
- On the notion of balance of a signed graph
- On the Vector Representations of Induced Matroids
- Orientation of signed graphs
- Signed graphs
- Some Generalizations of the Problem of Distinct Representatives
- Voltage graphs
Cited in
(only showing first 100 items - show all)- Determinant identities for Laplace matrices
- A combinatorial approach to matrix algebra
- Balanced vertex weightings and arborescences
- A generalization of the matrix-tree theorem
- The symbiotic relationship of combinatorics and matrix theory
- Identities of Rothe-Abel-Schläfli-Hurwitz-type
- The combinatorics of effective resistances and resistive inverses
- A generalization of the all minors matrix tree theorem to semirings
- Some determinant expansions and the matrix-tree theorem
- Laplacian matrices of graphs: A survey
- Hook immanantal inequalities for Laplacians of trees
- Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
- Multivariable Lagrange inversion, Gessel-Viennot cancellation, and the matrix tree theorem
- Generalized bicycles
- Tutte's barycenter method applied to isotopies
- On the weighted complexity of a regular covering of a graph
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- Homogeneous multivariate polynomials with the half-plane property
- Moore-Penrose inverse of incidence matrix of graphs with complete and cyclic blocks
- On the characteristic polynomial and eigenvectors in terms of the tree-like structure of a digraph
- A generalized inverse for graphs with absorption
- \(R\)-systems
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
- On the spectra of nonsymmetric Laplacian matrices
- The Tutte polynomial of a ported matroid
- On the dissection of rectangles into right-angled isosceles triangles
- Forest matrices around the Laplacian matrix
- The Grassmann-Berezin calculus and theorems of the matrix-tree type
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
- A note on the nullity of unicyclic signed graphs
- A colourful path to matrix-tree theorems
- Counting trees with random walks
- The number of spanning trees of a family of 2-separable weighted graphs
- A formula for all minors of the adjacency matrix and an application
- Directed forests and the constancy of Kemeny's constant
- A principle for converting Lindström-type lemmas to Stembridge-type theorems, with applications to walks, groves, and alternating flows
- The enumeration of spanning tree of weighted graphs
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
- Sequence graphs: characterization and counting of admissible elements
- Spectra of signed graphs
- Extremal spectral results related to spanning trees of signed complete graphs
- Matrix-tree theorem of digraphs via signless Laplacians
- Matroids arising from electrical networks
- Arborescences of covering graphs
- Boundary TBA, trees and loops
- Resistance distance and spanning 2-forest matrices of linear 2-trees
- Structure of minimum-weight directed forests: related forests and convexity inequalities
- Lewis Carroll and the red hot potato: a graph theoretic approach to a linear algebraic identity
- A combinatorial expression for the group inverse of symmetric \(M\)-matrices
- Characterizing immutable sandpiles: a first look
- Higher matrix-tree theorems and Bernardi polynomial
- Epidemiologic network inference
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- Effective fluctuation and response theory
- Electrical networks and hyperplane arrangements
- On the Laplacian coefficients of signed graphs
- Spectral characterizations of signed lollipop graphs
- Variances and covariances in the central limit theorem for the output of a transducer
- Graphical functions in parametric space
- Resistance characterizations of equiarboreal graphs
- On the determinant of the Laplacian matrix of a complex unit gain graph
- The exchange graph and variations of the ratio of the two Symanzik polynomials
- Optimal linear estimator of origin-destination flows with redundant data
- On minors of the compound matrix of a Laplacian
- On the spectrum of the normalized Laplacian for signed graphs: interlacing, contraction, and replication
- Principal minors Pfaffian half-tree theorem
- Meso-scale obstructions to stability of 1D center manifolds for networks of coupled differential equations with symmetric Jacobian
- On the dependence of the existence of the positive steady states on the rate coefficients for deficiency-one mass action systems: single linkage class
- Polynomials with the half-plane property and matroid theory
- Renormalization flow for unrooted forests on a triangular lattice
- Spanning forests and the golden ratio
- Laplace spectra of orgraphs and their applications
- Pfaffian orientations and perfect matchings of scale-free networks
- Distance matrix and Laplacian of a tree with attached graphs
- Bounds for the least Laplacian eigenvalue of a signed graph
- On the relationship between the multiplicities of the matrix spectrum and the signs of the components of its eigenvectors in a tree-like structure
- Identifiability of linear compartmental models: the singular locus
- On spectra of spectra
- On coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theorem
- Fully synchronous solutions and the synchronization phase transition for the finite-N Kuramoto model
- On the rank of weighted graphs
- Matroids -- the engineers' revenge
- On the complexity group of stable curves
- Free energy of \(\widehat{D_n}\) quiver Chern-Simons theories
- Vertex weighted complexities of graph coverings
- Negative dependence and the geometry of polynomials
- The complexity of power graphs associated with finite groups
- Kemeny's constant and an analogue of Braess' paradox for trees
- Resistance distance in directed cactus graphs
- Schramm's formula for multiple loop-erased random walks
- Feynman graph polynomials
- Bicycles and Spanning Trees
- Generalized matrix tree theorem for mixed graphs
- Algebraic/combinatorial proofs of Cayley-type identities for derivatives of determinants and Pfaffians
- Coding and counting spanning trees in Kleitman-Golden graphs
- Edge version of the matrix tree theorem for trees
- The Group Inverse of the Laplacian Matrix of a Graph
- Tangles and links: A view with trees
- Matrix-tree theorems and discrete path integration
- On the Laplacian Eigenvalues of Signed Graphs
This page was built for publication: A Combinatorial Proof of the All Minors Matrix Tree Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3958479)
