The number of spanning trees of a complete multipartite graph

DOI10.1016/S0012-365X(99)90111-5zbMATH Open0932.05043OpenAlexW4229577196MaRDI QIDQ1292859FDOQ1292859

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

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 Keywords

bijectioncomplete multipartite graphexpected degreeasymptotic probability

Mathematics Subject Classification ID

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

Cites Work

• Bijections for Cayley trees, spanning trees, and their q-analogues
• RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• Title not available (Why is that?)
• Spanning trees of extended graphs

Cited In (23)

• Linear algebraic techniques for weighted spanning tree enumeration
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• The number of spanning trees in some classes of graphs
• Title not available (Why is that?)
• Multidimensional Lambert-Euler inversion and vector-multiplicative coalescent processes
• Title not available (Why is that?)
• Spanning trees: A survey
• Spanning trees of extended 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
• Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
• On two conjectures concerning spanning tree edge dependences of graphs
• Title not available (Why is that?)
• Linear Algebraic Techniques for Spanning Tree Enumeration
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• Counting degree sequences of spanning trees in bipartite graphs: A graph‐theoretic proof
• Construction of efficient experimental designs under multiple resource constraints
• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
• Title not available (Why is that?)
• Spanning trees in multipartite geometric graphs
• Title not available (Why is that?)
• Spanning tree enumeration and nearly triangular graph Laplacians
• Number of spanning trees of different products of complete and complete bipartite graphs

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)