Matrix tree theorems

DOI10.1016/0097-3165(78)90067-5zbMath0376.05032OpenAlexW1978493550WikidataQ55952199 ScholiaQ55952199MaRDI QIDQ1245845

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90067-5

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (49)

Obtaining the long-term behavior of master equations with finite state space from the structure of the associated state transition network ⋮ Exact arborescences, matchings and cycles ⋮ Tangles and links: A view with trees ⋮ Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph ⋮ Coding and counting spanning trees in Kleitman-Golden graphs ⋮ Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes ⋮ Critical parameters for singular perturbation reductions of chemical reaction networks ⋮ Explicit determination of three invariants associated with random walks on n-prism networks ⋮ The algebraic structure of the KLT relations for gauge and gravity tree amplitudes ⋮ Drazin-inverse and heat capacity for driven random walkers on the ring ⋮ Lifted inference with tree axioms ⋮ Explicit expressions for stationary states of the Lindblad equation for a finite state space ⋮ A combinatorial mapping for the higher-dimensional matrix-tree theorem ⋮ Compound connection matrices ⋮ Negation can be exponentially powerful ⋮ The number and degree distribution of spanning trees in the Tower of Hanoi graph ⋮ Spectral analysis of weighted neighborhood networks ⋮ Extension of the Uhlenbeck-Ford model with an attraction ⋮ Generating functions and counting formulas for spanning trees and forests in hypergraphs ⋮ Models of random subtrees of a graph ⋮ On a wider class of prior distributions for graphical models ⋮ Matroids—the Engineers’ Revenge ⋮ The Alexander polynomial of planar even valence graphs ⋮ A generalization of the matrix-tree theorem ⋮ Codes and noncommutative stochastic matrices ⋮ A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. ⋮ Homogeneous multivariate polynomials with the half-plane property ⋮ Complete monotonicity for inverse powers of some combinatorially defined polynomials ⋮ Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems ⋮ The evaluation of the number and the entropy of spanning trees on generalized small-world networks ⋮ Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs ⋮ A note on two-way probabilistic automata ⋮ A combinatorial proof of a formula of Biane and Chapuy ⋮ An Operator Approach to the Principle of Inclusion and Exclusion ⋮ Enumerating all spanning trees for pairwise comparisons ⋮ A combinatorial proof of the Rayleigh formula for graphs ⋮ Zeon matrix inverses and the zeon combinatorial Laplacian ⋮ Associate Submersions and Qualitative Properties of Nonlinear Circuits with Implicit Characteristics ⋮ Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals ⋮ A family of matrix-tree multijections ⋮ The combinatorics of effective resistances and resistive inverses ⋮ Determinant identities for Laplace matrices ⋮ Counting spanning trees in self-similar networks by evaluating determinants ⋮ All solutions to the immobilizer problem ⋮ Some properties of a multidigraph by semi-incidence matrices ⋮ Form factors and generalized hydrodynamics for integrable systems ⋮ Forest matrices around the Laplacian matrix ⋮ Some determinant expansions and the matrix-tree theorem ⋮ Laplacian matrices of graphs: A survey

Cites Work

This page was built for publication: Matrix tree theorems