Honors Project - Open Access
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.
Holcombe Pomerance, Ari, "Mixing Measures for Trees of Fixed Diameter" (2023). Mathematics, Statistics, and Computer Science Honors Projects. 82.
© Copyright is owned by author of this document