Results 21 to 30 of about 2,028,246 (339)
Cliques and the Spectral Radius
Journal of Combinatorial Theory, Series B, 2006 We present a number of relations involving the number of cliques in a graph and its spectral radius.
Béla Bollobás, Vladimir Nikiforov
openalex +5 more sources
Proof of a conjecture on the ϵ-spectral radius of trees
AIMS Mathematics, 2023 The ϵ-spectral radius of a connected graph is the largest eigenvalue of its eccentricity matrix. In this paper, we identify the unique n-vertex tree with diameter 4 and matching number 5 that minimizes the ϵ-spectral radius, and thus resolve a conjecture
Jianping Li , Leshi Qiu , Jianbin Zhang
doaj +1 more source
A lower bound for the spectral radius [PDF]
Proceedings of the American Mathematical Society, 1980 We prove an inequality for a problem of Carathéodory type: given n inner functions m 1 , m 2 , … , m n {m_1},{m_2}, \ldots ,{m_n} , to find the ...
Vlastimil Pták
openalex +2 more sources
A spectral method for retrieving cloud optical thickness and effective radius from surface-based transmittance measurements [PDF]
Atmospheric Chemistry and Physics, 2011 We introduce a new spectral method for the retrieval of optical thickness and effective radius from cloud transmittance that relies on the spectral slope of the normalized transmittance between 1565 nm and 1634 nm, and on cloud transmittance at a visible
P. J. McBride +4 more
doaj +1 more source
Optimizing the Spectral Radius [PDF]
SIAM Journal on Matrix Analysis and Applications, 2013 We suggest a new approach to finding the maximal and the minimal spectral radii of linear operators from a given compact family of operators, which share a common invariant cone (e.g., family of no...
Yurii Nesterov, Vladimir Yu. Protasov
openaire +2 more sources
On the Zero Forcing Number and Spectral Radius of Graphs
Electronic Journal of Combinatorics, 2022 In this paper, we determine the graphs (respectively, trees) with maximum spectral radius among all graphs (respectively, trees) with zero forcing number at most $k$.
Wenqian Zhang +3 more
semanticscholar +1 more source
Journal of Inequalities and Applications, 2020 In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj +1 more source
Some spectral sufficient conditions for a graph being pancyclic
AIMS Mathematics, 2020 Let $G(V,E)$ be a simple connected graph of order $n$. A graph of order $n$ is called pancyclic if it contains all the cycles $C_k$ for $k\in \{3,4,\cdot\cdot\cdot,n\}$. In this paper, some new spectral sufficient conditions for the graph to be pancyclic
Huan Xu +5 more
doaj +1 more source
On spectral radius algebras [PDF]
Operators and Matrices, 2008 We show how one can associate a Hermitian operator P to every operator A , and we prove that the invertibility properties of P imply the non-transitivity and density of the spectral radius algebra associated to A . In the finite dimensional case we give a complete characterization of these algebras in terms of P .
Alan Lambert +3 more
openaire +1 more source
Bounds of modified Sombor index, spectral radius and energy
AIMS Mathematics, 2021 Let $ G $ be a simple graph with edge set $ E(G) $. The modified Sombor index is defined as $ ^{m}SO(G) = \sum\limits_{uv\in E(G)}\frac{1}{\sqrt{d_{u}^{2}~~+~~d_{v}^{2}}} $, where $ d_{u} $ (resp. $ d_{v} $) denotes the degree of vertex $ u $ (resp. $ v $
Yufei Huang, Hechao Liu
semanticscholar +1 more source