Results 1 to 10 of about 1,642,309 (160)
Why the Spectral Radius? An intuition-building introduction to the basic reproduction number. [PDF]
Bull Math Biol, 2022 The basic reproduction number R0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin ...
Brouwer AF.
europepmc +2 more sources
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
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
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
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
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
Spectral radius and k-factor-critical graphs [PDF]
Journal of Supercomputing, 2023 For a nonnegative integer $k$, a graph $G$ is said to be $k$-factor-critical if $G-Q$ admits a perfect matching for any $Q\subseteq V(G)$ with $|Q|=k$. In this article, we prove spectral radius conditions for the existence of $k$-factor-critical graphs ...
Sizhong Zhou, Zhiren Sun, Yuli Zhang
semanticscholar +1 more source
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
Spectral radius and edge‐disjoint spanning trees [PDF]
Journal of Graph Theory, 2022 The spanning tree packing number of a graph G $G$ , denoted by τ( G ) $\tau (G)$ , is the maximum number of edge‐disjoint spanning trees contained in G $G$ . The study of τ( G ) $\tau (G)$ is one of the classic problems in graph theory.
Dandan Fan, Xiaofeng Gu, Huiqiu Lin
semanticscholar +1 more source