Spanning Trees and Domination in Hypercubes

Jerrold R. Griggs

Let $L(G)$ denote the maximum number of leaves in any spanning tree of a connected graph $G$. We show the (known) result that for the $n$-cube $Q_n$, $L(Q_n)\sim 2^n=|V(Q_n)|$ a…