The number of spanning trees of a complete multipartite graph

DOI10.1016/S0012-365X(99)90111-5zbMath0932.05043OpenAlexW4229577196MaRDI 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

bijectioncomplete multipartite graphexpected degreeasymptotic probability

Mathematics Subject Classification ID

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

Related Items (11)

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

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

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