Characterizing spanning trees via the size or the spectral radius of graphs

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Operations research and management science (90B99) Distance in graphs (05C12)

Cites Work

Title not available (Why is that?)
Packing 3-vertex paths in claw-free graphs and related topics
Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
On a connection between the existence of k-trees and the toughness of a graph
Spanning trees with bounded degrees
A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
The existence of a path-factor without small odd paths
Packing paths of length at least two
On the spectrum of an equitable quotient matrix and its application
Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
Some results on path-factor critical avoidable graphs
On path-factor critical deleted (or covered) graphs
An odd \([ 1 , b \)-factor in regular graphs from eigenvalues]
Spectral radius and matchings in graphs
Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
Spanning trees with few leaves
Fan-type results for the existence of [\(a\),\(b\)-factors]
Some sufficient conditions for path-factor uniform graphs
Independence trees and Hamilton cycles
Spanning trees with many leaves
A sufficient condition for a graph to have a \(k\)-tree
Spanning trees with constraints on the leaf degree
Eigenvalues and [a,b‐factors in regular graphs]
Path factors and neighborhoods of independent sets in graphs
Sun toughness and path-factor uniform graphs
Path-factor critical covered graphs and path-factor uniform graphs
\(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
The \(A_\alpha\)-spectral radius for path-factors in graphs
Remarks on restricted fractional \((g, f)\)-factors in graphs
Distance signless Laplacian spectral radius for the existence of path-factors in graphs