The Spectral Radius
On the spectral radius of nonnegative matrices*
... We give lower bounds for the spectral radius of nonnegative matrices and nonnegative symmetric matrices, and prove necessary and sufficient conditions to achieve thes[r] ...
6
The spectral radius of triangle-free graphs
... [email protected] Abstract In this note, we present two lower bounds for the spectral radius of the Laplacian matrices of triangle-free graphs. One is in terms of the numbers of edges and vertices of ...
7
Some inequalities on the spectral radius of matrices
... Full list of author information is available at the end of the article Abstract Let A 1 ,A 2 , . . . , A k be nonnegative matrices. In this paper, some upper bounds for the spectral radius ρ (A 1 ◦ A 2 ◦ · ...
12
A new bound for the spectral radius of nonnegative tensors
... the spectral radius of nonnegative tensors In this section, we first give a lemma to estimate the ratio of the smallest component and the largest component of a Perron vector, and then we give a bound for ...
12
New bounds for the spectral radius for nonnegative tensors
... the spectral radius of a nonnegative tensor, Yang and Yang [] provided a lower bound and an upper bound for the spectral radius of a nonnegative ...
9
On the difference between the spectral radius and the maximum degree of graphs
... In sequel we study the minim value of β(G) among the family of non-regular connected graphs G. We need the following nice upper bound on the spectral radius of trees... Theorem 3. It is [r] ...
6
On Cogrowth, Amenability and the Spectral Radius of a Random Walk on a Semigroup
... RADIUS OF A RANDOM WALK ON A SEMIGROUP ROBERT ...the spectral radius of the associated Markov operators (when defined) on ` 2 ...the spectral radius to be at least 1; since left ...
32
On the spectral radius of bipartite graphs which are nearly complete
... λ (G) ≥ λ (G) ≥ · · · ≥ λ n– (G) ≥ λ n (G). The largest eigenvalue λ (G) is often called the spectral radius of G. Throughout this paper, we will consider only finite, simple, undirected, bipartite ...
5
Finding the spectral radius of a large sparse non-negative matrix
... the spectral radius of a non-negative matrix is important in showing the uniqueness of solution of a linear system which arises in Input- Output Analysis, a branch of Mathematical Economics ...
16
Bounds on the spectral radius of a Hadamard product of nonnegative or positive semidefinite matrices
... the spectral radius of the Hadamard product of two square nonnegative matrices is not greater than the spectral radius of their ordinary ...
6
Growth rates of permutation grid classes, tours on graphs, and the spectral radius
... 3 Grid classes In this section, we prove our main theorem, that the growth rate of a monotone grid class of permutations is equal to the square of the spectral radius of its row-column graph. The proof is ...
34
Some Bounds For The Spectral Radius Of Hadamard Product & Kronecker Product Of Matrices.
... spectral radius. Special emphasis is given to properties of the spectral radius, and presents several inequalities for the spectral radii of sums, products, and commutators of ...the ...
17
An always convergent method for finding the spectral radius of an irreducible non-negative
... (Received 8 August 2003, revised 15 January 2004, corrected 7 Oct 2007) Abstract An always convergent method is used to calculate the spectral radius of an irreducible non-negative matrix. The method is an ...
12
Some new sharp bounds for the spectral radius of a nonnegative matrix and its application
... Abstract In this paper, we give some new sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. Using these bounds, we obtain some new and improved bounds for the signless ...
6
Some new estimations for the upper and lower bounds for the spectral radius of nonnegative matrices
... the spectral radius of the Hadamard product of two nonnegative matrices and some upper and lower bounds on the spectral radius of the iterative matrix of a nonsingular M-matrix are ...
14
Bounds on the (Laplacian) spectral radius of graphs
... In Section 2, we will give some sharp bounds on the spectral radius of connected graphs and some sharp upper bounds of the Nordhaus–Gaddum type on the sum of spectral radii of a connecte[r] ...
16
On spectral radius and energy of complete multipartite graphs
... The above claims were the motivation for establishing our main results: Theorem 1.6. Let p ≥ 2 and n 1 + n 2 + · · · + n p be equal to a fixed integer n. Then the spectral radius and the energy of K n 1 ,n ...
5
Centrality and spectral radius in dynamic communication networks
... to spectral radius (the largest eigenvalue) of the network at any point in time and its computation in the case of large ...the spectral radius bound on attenuation factor is relaxed and the ...
12
Graphs with maximal signless Laplacian spectral radius
... the spectral radius of the signless Laplacian of the graph G is less than that of G − uv + ...Laplacian spectral radius over the class of graphs with m edges and m − k vertices, for k = 0, ...
26
Spectral Radius and Some Hamiltonian Properties of Graphs
... We consider only finite undirected graphs without loops or multiple edges. Notation and terminology not defined here follow those in [2]. For a graph , , we use , , , and Δ to denote its order || , size || , minimum ...
5