Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Mathematics
Mixing Measures For Trees Of Fixed Diameter, Ari Holcombe Pomerance
Mixing Measures For Trees Of Fixed Diameter, Ari Holcombe Pomerance
Mathematics, Statistics, and Computer Science Honors Projects
A mixing measure is the expected length of a random walk in a graph given a set of starting and stopping conditions. We determine the tree structures of order n with diameter d that minimize and maximize for a few mixing measures. We show that the maximizing tree is usually a broom graph or a double broom graph and that the minimizing tree is usually a seesaw graph or a double seesaw graph.