Most, And Least, Compact Spanning Trees of a Graph

Gyan Ranjan, Nishant Saurabh, Amit Ashutosh

We introduce the concept of Most, and Least, Compact Spanning Trees - denoted respectively by $T^{\ast }(G)$ and $T^{\#}(G)$ - of a simple, connected, undirected and unweighted graph $G(V,…