Counting spanning trees in almost complete multipartite graphs
From MaRDI portal
Recommendations
- Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
- On the number of spanning trees of \(K^m_n \pm G\) graphs
- The number of spanning trees in generalized complete multipartite graphs of wheel-type
- The number of spanning trees of a complete multipartite graph
- Counting spanning trees in a complete bipartite graph which contain a given spanning forest
Cites work
- A simple formula for the number of spanning trees of line graphs
- Algebraic Graph Theory
- Algebraic Potential Theory on Graphs
- Determinant identities for Laplace matrices
- Enumerating spanning trees of graphs with an involution
- Enumerative properties of Ferrers graphs
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- Linear algebraic techniques for weighted spanning tree enumeration
- On the energy of blossomed stars
- Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
- Resistance distance in complete n-partite graphs
- Simplicial matrix-tree theorems
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
- The enumeration of spanning tree of weighted graphs
Cited in
(24)- Number of spanning trees of different products of complete and complete bipartite graphs
- Spanning trees in multipartite geometric graphs
- The non-\(\ell\)-part of the number of spanning trees in abelian \(\ell\)-towers of multigraphs
- Counting graphs with different numbers of spanning trees through the counting of prime partitions
- The number of spanning trees in generalized complete multipartite graphs of wheel-type
- Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof
- 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?)
- Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications
- 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
- Resistance distances in generalized join graphs
- Counting spanning trees with one perfect matching in helicene polygonal chains on the plane and cylinder
- Enumeration of spanning trees and resistance distances of generalized blow-up graphs
- Maximal polyomino chains with respect to the Kirchhoff index
- The number of spanning trees of the bipartite complement of a semiregular bipartite graph
- The resistance distance of a dual number weighted graph
- Weighted Moon-type formulae for complete graphs and complete bipartite graphs
- A variant of the Teufl-Wagner formula and applications
- The number of spanning trees in \(K_{m , n}\)-complements of bipartite graphs
- Counting matchable spanning trees of join graphs
- 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
This page was built for publication: Counting spanning trees in almost complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082527)
