3 research outputs found
Spectral radius conditions for fractional -covered graphs
A graph is called fractional -covered if for every edge of
there is a fractional -factor with the indicator function such that
. In this paper, we provide tight spectral radius conditions for graphs
being fractional -covered.Comment: 9 page
Spanning k-trees and distance spectral radius in graphs
Let be an integer. A tree is called a -tree if
for each , that is, the maximum degree of a -tree is at most .
Let denote the distance spectral radius in , where
denotes the distance matrix of . In this paper, we verify a upper bound for
in a connected graph to guarantee the existence of a
spanning -tree in .Comment: 11 page