Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix
189
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known results about various spectral radii, including the adjacency spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance signless Laplacian spectral radius of a graph or a digraph.
rate research
Read More
In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative weakly irreducible tensor. We also apply these bounds to the adjacency spectral radius and signless Laplacian spectral radius of a uniform hypergraph.
In this paper, 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 a graph or a digraph. These results are new or generalize some known results.
We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give a sharp upper bound of the spectral radius of $C$ expressed by the sum of entries, the largest off-diagonal entry $f$ and the largest diagonal entry $d$ in $C$. We also give a new class of sharp lower bounds of the spectral radius of $C$ expressed by the above $d$ and $f$, the least row-sum $r_n$ and the $t$-th largest row-sum $r_t$ in $C$ satisfying $0<r_n-(n-t-1)f-dleq r_t-(n-t)f$, where $n$ is the size of $C$.
For a nonnegative weakly irreducible tensor $mathcal{A}$, we give some characterizations of the spectral radius of $mathcal{A}$, by using the digraph of tensors. As applications, some bounds on the spectral radius of the adjacency tensor and the signless Laplacian tensor of the $k$-uniform hypergraphs are shown.
For $0leq alpha < 1$, the $mathcal{A}_{alpha}$-spectral radius of a $k$-uniform hypergraph $G$ is defined to be the spectral radius of the tensor $mathcal{A}_{alpha}(G):=alpha mathcal{D}(G)+(1-alpha) mathcal{A}(G)$, where $mathcal{D}(G)$ and $A(G)$ are diagonal and the adjacency tensors of $G$ respectively. This paper presents several lower bounds for the difference between the $mathcal{A}_{alpha}$-spectral radius and an average degree $frac{km}{n}$ for a connected $k$-uniform hypergraph with $n$ vertices and $m$ edges, which may be considered as the measures of irregularity of $G$. Moreover, two lower bounds on the $mathcal{A}_{alpha}$-spectral radius are obtained in terms of the maximum and minimum degrees of a hypergraph.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
