The number of spanning trees of a complete multipartite graph

DOI10.1016/S0012-365X(99)90111-5zbMath0932.05043MaRDI QIDQ1292859

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

bijection; complete multipartite graph; expected degree; asymptotic probability

Mathematics Subject Classification ID

05C05: Trees

05C30: Enumeration in graph theory

05A16: Asymptotic enumeration

Related Items

Construction of efficient experimental designs under multiple resource constraints, Linear Algebraic Techniques for Spanning Tree Enumeration, Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition, Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics, Multidimensional Lambert-Euler inversion and vector-multiplicative coalescent processes, On two conjectures concerning spanning tree edge dependences of graphs, Spanning trees: A survey, The number of spanning trees in some classes of graphs, Number of spanning trees of different products of complete and complete bipartite graphs, Spanning tree enumeration and nearly triangular graph Laplacians, Linear algebraic techniques for weighted spanning tree enumeration

Cites Work

• Unnamed Item
• Bijections for Cayley trees, spanning trees, and their q-analogues
• Spanning trees of extended graphs
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE