Lower bounds for the spanning tree numbers of two graph products

Hengzhe Li, Xueliang Li, Yaping Mao +1

For any graph $G$ of order $n$, the spanning tree packing number \emph{$STP(G)$}, is the maximum number of edge-disjoint spanning trees contained in $G$. In this paper, we obtain s…