Results 1 to 10 of about 2,028,246 (339)
Local Homeostatic Regulation of the Spectral Radius of Echo-State Networks [PDF]
Frontiers in Computational Neuroscience, 2021 Recurrent cortical networks provide reservoirs of states that are thought to play a crucial role for sequential information processing in the brain.
Fabian Schubert, Claudius Gros
doaj +2 more sources
On the α-Spectral Radius of Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2020 For 0 ≤ α ---lt--- 1 and a uniform hypergraph G, the α-spectral radius of G is the largest H-eigenvalue of αD(G)+(1−α)A(G), where D(G) and A(G) are the diagonal tensor of degrees and the adjacency tensor of G, respectively. We give upper bounds for the α-
Guo Haiyan, Zhou Bo
doaj +2 more sources
On the distance α-spectral radius of a connected graph
Journal of Inequalities and Applications, 2020 For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj +2 more sources
Bounds of the Spectral Radius and the Nordhaus-Gaddum Type of the Graphs [PDF]
The Scientific World Journal, 2013 The Laplacian spectra are the eigenvalues of Laplacian matrix L(G)=D(G)-A(G), where D(G) and A(G) are the diagonal matrix of vertex degrees and the adjacency matrix of a graph G, respectively, and the spectral radius of a graph G is the largest ...
Tianfei Wang, Liping Jia, Feng Sun
doaj +2 more sources
Some new sharp bounds for the spectral radius of a nonnegative matrix and its application [PDF]
Journal of Inequalities and Applications, 2017 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 Laplacian spectral radius of a graph or a digraph.
Jun He +3 more
doaj +2 more sources
On the spectral radius and energy of signless Laplacian matrix of digraphs [PDF]
Heliyon, 2022 Let D be a digraph of order n and with a arcs. The signless Laplacian matrix Q(D) of D is defined as Q(D)=Deg(D)+A(D), where A(D) is the adjacency matrix and Deg(D) is the diagonal matrix of vertex out-degrees of D.
Hilal A. Ganie, Yilun Shang
doaj +2 more sources
Graphs Whose Aα -Spectral Radius Does Not Exceed 2
Discussiones Mathematicae Graph Theory, 2020 Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any real α ∈ [0, 1], we consider Aα (G) = αD(G) + (1 − α)A(G) as a graph matrix, whose largest eigenvalue is called the Aα -spectral radius of G.
Wang Jian Feng +3 more
doaj +2 more sources
Some inequalities on the spectral radius of matrices [PDF]
Journal of Inequalities and Applications, 2018 Let A 1 , A 2 , … , A k $A_{1}, A_{2},\ldots, A_{k}$ be nonnegative matrices. In this paper, some upper bounds for the spectral radius ρ ( A 1 ∘ A 2 ∘ ⋯ ∘ A k ) $\rho(A_{1}\circ A_{2}\circ\cdots\circ A_{k})$ are proposed.
Linlin Zhao, Qingbing Liu
doaj +2 more sources
A formula for the inner spectral radius [PDF]
International Journal of Mathematics and Mathematical Sciences, 2004 This note presents an asymptotic formula for the minimum of the moduli of the elements in the spectrum of a bounded linear operator acting on Banach space X.
S. Mahmoud Manjegani
doaj +2 more sources
Spectral Radius of Graphs with Given Size and Odd Girth [PDF]
Electronic Journal of Combinatorics, 2022 Let $\mathcal{G}(m,k)$ be the set of graphs with size $m$ and odd girth (the length of shortest odd cycle) $k$. In this paper, we determine the graph maximizing the spectral radius among $\mathcal{G}(m,k)$ when $m$ is odd.
Zhenzhen Lou, Lu Lu, Xueyi Huang
semanticscholar +1 more source