The enumeration of spanning tree of weighted graphs

DOI10.1007/s10801-020-00969-wzbMath1470.05082OpenAlexW3072883259MaRDI QIDQ2045062

Jiang Zhou, Changjiang Bu

Publication date: 11 August 2021

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-020-00969-w

zbMATH Keywords

intersection graphspanning treeLaplacian matrixclique partitionmatrix-tree theorem

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (11)

Spectral radius and clique partitions of graphs ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ Enumeration of spanning trees of middle digraphs ⋮ Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest ⋮ 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 ⋮ Unnamed Item ⋮ A combinatorial expression for the group inverse of symmetric \(M\)-matrices ⋮ Resistance distance and Kirchhoff index of the Q-vertex (or edge) join graphs ⋮ Counting spanning trees in almost complete multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Zeta functions and complexities of middle graphs of semiregular bipartite graphs
• Structural properties of the minimum cut of partially-supplied graphs
• Spectra of graphs
• On the expected penalty functions in a discrete semi-Markov risk model with randomized dividends
• Determinantal identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley
• Zeta functions and complexities of a semiregular bipartite graph and its line graph
• Clique-inserted-graphs and spectral dynamics of clique-inserting
• Enumerating spanning trees of graphs with an involution
• Determinant identities for Laplace matrices
• Spanning trees in regular graphs
• Clique partitions and clique coverings
• Line graphs, root systems, and elliptic geometry
• Factorizations of some weighted spanning tree enumerators
• A spectral characterization of the \(s\)-clique extension of the square grid graphs
• Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
• A combinatorial Laplacian with vertex weights
• On polynomials of spanning trees
• On the number of spanning trees of some irregular line graphs
• Applications of M-matrices to non-negative matrices
• NOTE ON M-MATRICES
• Simplicial matrix-tree theorems
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• The number of spanning trees in regular graphs
• Kronecker Products and Local Joins of Graphs
• Algebraic Graph Theory
• The $Q$-spectrum and spanning trees of tensor products of bipartite graphs
• A simple formula for the number of spanning trees of line graphs
• ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
• The Representation of a Graph by Set Intersections
• Asymptotic Enumeration of Spanning Trees
• Graphs with least eigenvalue \(-2\): The star complement technique

This page was built for publication: The enumeration of spanning tree of weighted graphs