Abstract
AbstractThe 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 eigenvalue of the adjacency matrix in the past decade. In this paper, we further extend the results in terms of the number of edges and the spectral radius, respectively; and prove tight sufficient conditions to guarantee with extremal graphs characterized. Moreover, we confirm a conjecture of Ning, Lu, and Wang on characterizing graphs with the maximum spectral radius among all graphs with a given order as well as fixed minimum degree and fixed edge connectivity. Our results have important applications in rigidity and nowhere‐zero flows. We conclude with some open problems in the end.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
