The number of spanning trees of a complete multipartite graph

DOI10.1016/S0012-365X(99)90111-5MaRDI QIDQ1292859zbMATH OpenOpenAlexFDO

Authors Richard P. Lewis

Publication date 27 February 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)90111-5

zbMATH Keywords

bijectioncomplete multipartite graphexpected degreeasymptotic probability

Mathematics Subject Classification ID

Trees (05C05) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 2076810
• scientific article; zbMATH DE number 841581
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• The number of spanning trees in generalized complete multipartite graphs of Fan-type
• scientific article; zbMATH DE number 4142059

Cites work

• scientific article; zbMATH DE number 841581 (Why is no real title available?)
• Bijections for Cayley trees, spanning trees, and their q-analogues
• RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE
• Spanning trees of extended graphs
• The Enumeration of Point Labelled Chromatic Graphs and Trees

Cited in

(25)

• Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
• On two conjectures concerning spanning tree edge dependences of graphs
• Spanning trees of extended graphs
• Construction of efficient experimental designs under multiple resource constraints
• Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof
• scientific article; zbMATH DE number 6719620 (Why is no real title available?)
• Multidimensional Lambert-Euler inversion and vector-multiplicative coalescent processes
• scientific article; zbMATH DE number 4142059 (Why is no real title available?)
• Counting graphs with different numbers of spanning trees through the counting of prime partitions
• Linear algebraic techniques for weighted spanning tree enumeration
• Counting spanning trees in almost complete multipartite graphs
• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
• The number of spanning trees in generalized complete multipartite graphs of wheel-type
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• scientific article; zbMATH DE number 841581 (Why is no real title available?)
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• Spanning trees in multipartite geometric graphs
• Number of spanning trees of different products of complete and complete bipartite graphs
• scientific article; zbMATH DE number 2127724 (Why is no real title available?)
• The number of spanning trees in some classes of graphs
• scientific article; zbMATH DE number 2076810 (Why is no real title available?)
• The non-\(\ell\)-part of the number of spanning trees in abelian \(\ell\)-towers of multigraphs
• Spanning tree enumeration and nearly triangular graph Laplacians
• Linear algebraic techniques for spanning tree enumeration
• Spanning trees: A survey

This page was built for publication: The number of spanning trees of a complete multipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292859)