Displaying 661 – 680 of 1226

Showing per page

A result related to the largest eigenvalue of a tree

Gurusamy Rengasamy Vijayakumar (2008)

Discussiones Mathematicae Graph Theory

In this note we prove that {0,1,√2,√3,2} is the set of all real numbers l such that the following holds: every tree having an eigenvalue which is larger than l has a subtree whose largest eigenvalue is l.

A sharp upper bound for the spectral radius of a nonnegative matrix and applications

Lihua You, Yujie Shu, Xiao-Dong Zhang (2016)

Czechoslovak Mathematical Journal

We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance Laplacian spectral radius, the distance signless Laplacian spectral radius of an undirected graph or a digraph. These results are new or generalize some known results.

Currently displaying 661 – 680 of 1226