The enumeration of spanning tree of weighted graphs
From MaRDI portal
Recommendations
Cites work
- A combinatorial Laplacian with vertex weights
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A simple formula for the number of spanning trees of line graphs
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- Algebraic Graph Theory
- An introduction to the theory of graph spectra
- Applications of M-matrices to non-negative matrices
- Asymptotic Enumeration of Spanning Trees
- Clique partitions and clique coverings
- Clique-inserted-graphs and spectral dynamics of clique-inserting
- Determinant identities for Laplace matrices
- Determinantal identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley
- Enumerating spanning trees of graphs with an involution
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
- Factorizations of some weighted spanning tree enumerators
- Graphs with least eigenvalue -2: The star complement technique
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
- Kronecker Products and Local Joins of Graphs
- Line graphs, root systems, and elliptic geometry
- NOTE ON M-MATRICES
- On polynomials of spanning trees
- On the expected penalty functions in a discrete semi-Markov risk model with randomized dividends
- On the normalised Laplacian spectrum, degree-Kirchhoff index and spanning trees of graphs
- On the nullity of connected graphs with least eigenvalue at least -2
- On the number of spanning trees of some irregular line graphs
- Simplicial matrix-tree theorems
- Spanning trees in regular graphs
- Spectra of graphs
- Structural properties of the minimum cut of partially-supplied graphs
- The Q-spectrum and spanning trees of tensor products of bipartite graphs
- The number of spanning trees in regular graphs
- The Representation of a Graph by Set Intersections
- Zeta functions and complexities of a semiregular bipartite graph and its line graph
- Zeta functions and complexities of middle graphs of semiregular bipartite graphs
Cited in
(33)- Enumerating spanning trees of graphs with an involution
- Factorizations of some weighted spanning tree enumerators
- A combinatorial proof of a formula of Biane and Chapuy
- The number of spanning trees of a family of 2-separable weighted graphs
- Resistance distance and Kirchhoff index of the Q-vertex (or edge) join graphs
- Counting spanning trees in almost complete multipartite graphs
- Enumeration of spanning trees of 2-separable networks
- A combinatorial expression for the group inverse of symmetric \(M\)-matrices
- Linear algebraic techniques for weighted spanning tree enumeration
- A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
- Enumeration of spanning trees in a chain of diphenylene graphs
- Enumeration of spanning trees of middle digraphs
- Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
- scientific article; zbMATH DE number 7771742 (Why is no real title available?)
- Counting spanning trees with a Kekulé structure in linear hexagonal chains
- Oriented spanning trees and stationary distribution of digraphs
- Counting spanning trees of (1, N)-periodic graphs
- Spectra of power hypergraphs and signed graphs via parity-closed walks
- Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink
- The number of spanning trees in K_n-complement of a bipartite graph
- Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
- Counting spanning trees of multiple complete split-like graph containing a given spanning forest
- Resistance distances in generalized join graphs
- Decomposing convex bipartite graphs into biconvex graphs and enumerating minimum weight red blue dominating sets
- Counting spanning trees with one perfect matching in helicene polygonal chains on the plane and cylinder
- The number of spanning trees of the bipartite complement of a semiregular bipartite graph
- Bounds on the resistance distance and Kirchhoff index of graphs
- The number of spanning trees in \(K_{m , n}\)-complements of bipartite graphs
- On the statistics of dimer coverings and spanning trees on the silicate-type Sierpinski gasket
- Maximum number of spanning trees and connectivity: graphs with a fixed minimum degree and bipartite graphs
- Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs
- Weighted spanning forests with specified roots in complete s-partite graphs
- Spectral radius and clique partitions of graphs
This page was built for publication: The enumeration of spanning tree of weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045062)
