The P-Laplacian spectral radius of weighted trees with a degree sequence and a weight set.
A note on ultrametric matrices
It is proved in this paper that special generalized ultrametric and special matrices are, in a sense, extremal matrices in the boundary of the set of generalized ultrametric and matrices, respectively. Moreover, we present a new class of inverse -matrices which generalizes the class of matrices.
The equality cases for the inequalities of Oppenheim and Schur for positive semi-definite matrices
In this paper, necessary and sufficient conditions for equality in the inequalities of Oppenheim and Schur for positive semidefinite matrices are investigated.
The first Dirichlet eigenvalue of bicyclic graphs
In this paper, we have investigated some properties of the first Dirichlet eigenvalue of a bicyclic graph with boundary condition. These results can be used to characterize the extremal bicyclic graphs with the smallest first Dirichlet eigenvalue among all the bicyclic graphs with a given graphic bicyclic degree sequence with minor conditions. Moreover, the extremal bicyclic graphs with the smallest first Dirichlet eigenvalue among all the bicycle graphs with fixed interior vertices of degree...
Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices
We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matrices in terms of the averaged minimal cut of weighted graphs. This is used to obtain an upper bound for the real parts of the non-maximal eigenvalues of irreducible nonnegative matrices. The result can be applied to Markov chains.
A sharp upper bound for the spectral radius of a nonnegative matrix and applications
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.
Page 1