The spanning tree packing number of a graph
, denoted by
, is the maximum number of edge‐disjoint spanning trees contained in
. The study of
is one of the classic problems in graph theory. Cioabă and Wong initiated to investigate
from spectral perspectives in 2012 and since then,
has been well studied using the second‐largest...