The Expected Length of a Minimal Spanning Tree of a Cylinder Graph

Authors:
Kevin Hutson;Thomas M. Lewis
Affiliations:
Department of Mathematics, Furman University, Greenville, SC 29613, USA (e-mail: kevin.hutsonk@furman.edu);Department of Mathematics, Furman University, Greenville, SC 29613, USA (e-mail: tom.lewis@furman.edu)
Venue:
Combinatorics, Probability and Computing
Year:
2007

Citing 7
Cited 1

Enumerative combinatorics

Enumerative combinatorics
On Frieze's &zgr;(3) limit for lengths of minimal spanning trees

Discrete Applied Mathematics
The algebraic eigenvalue problem

The algebraic eigenvalue problem
The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph

Random Structures & Algorithms
Random minimal spanning tree and percolation on the N-cube

Random Structures & Algorithms
The tutte polynomial

Random Structures & Algorithms - Special issue on statistical physics methods in discrete probability, combinatorics, and theoretical computer science
A matrix method for chromatic polynomials

Journal of Combinatorial Theory Series B

On the difference of expected lengths of minimum spanning trees

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A cylinder graph is the graph Cartesian product of a path and a cycle. In this paper we investigate the length of a minimal spanning tree of a cylinder graph whose edges are assigned random lengths according to independent and uniformly distributed random variables. Our work was inspired by a formula of J. Michael Steele which shows that the expected length of a minimal spanning tree of a connected graph can be calculated through the Tutte polynomial of the graph. First, using transfer matrices, we show how to calculate the Tutte polynomials of cylinder graphs. Second, using Steele's formula, we tabulate the expected lengths of the minimal spanning trees for some cylinder graphs. Third, for a fixed cycle length, we show that the ratio of the expected length of a minimal spanning tree of a cylinder graph to the length of the cylinder graph converges to a constant; this constant is described in terms of the Perron–Frobenius eigenvalue of the accompanying transfer matrix. Finally, we show that the length of a minimal spanning tree of a cylinder graph satisfies a strong law of large numbers.