Results 31 to 40 of about 1,181,505 (283)
Perron-Frobenius Theorem for Spectral Radius Analysis [PDF]
, 2016 The spectral radius of a matrixAis the maximum norm of alleigenvalues ofA. In previous work we already formalized that for acomplex matrixA, the values inAngrow polynomially innif andonly if the spectral radius is at most one.
José Divasón [0000-0002-5173-128X] +3 more
core +1 more source
The Aα-spectral radius of complements of bicyclic and tricyclic graphs with n vertices
Special Matrices, 2021 Recently, the extremal problem of the spectral radius in the class of complements of trees, unicyclic graphs, bicyclic graphs and tricyclic graphs had been studied widely.
Chen Chaohui +2 more
doaj +1 more source
Second Hyper Zagreb Spectral Radii of Graph Operations
Scientific Annals of Computer ScienceChemical graph theory is essential for deriving graph spectral radius, especially in quantum chemistry; a significant link exists between eigenvalues and this invariant of spectral graph theory.
Ahmad Bilal, Muhammad Mobeen Munir
doaj +1 more source
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 +1 more source
On Extremal Spectral Radii of Uniform Supertrees with Given Independence Number
Discrete Dynamics in Nature and Society, 2022 A supertree is a connected and acyclic hypergraph. Denote by Tm,n,α the set of m-uniform supertrees of order n with independent number α. Focusing on the spectral radius in Tm,n,α, this present completely determines the hypergraphs with maximum spectral ...
Lei Zhang, Haizhen Ren
doaj +1 more source
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 The sum-connectivity index of a graph G is defined as the sum of weights [Formula: see text] over all edges uv of G, where du and dv are the degrees of the vertices u and v in G, respectively.
A. Jahanbani, S. M. Sheikholeslami
doaj +1 more source
Reverse Inequalities for the Numerical Radius of Linear Operators in Hilbert Spaces [PDF]
, 2005 Some elementary inequalities providing upper bounds for the difference of the norm and the numerical radius of a bounded linear operator on Hilbert spaces under appropriate conditions are ...
Sever S. Dragomir, Dragomir, Sever S
core +1 more source
A note on distance spectral radius of trees
Special Matrices, 2017 The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. We determine the unique non-starlike non-caterpillar tree with maximal distance spectral radius.
Wang Yanna +3 more
doaj +1 more source
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
FEBS Letters, EarlyView.Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt +8 more
wiley +1 more source
Upper Bounds for the Euclidean Operator Radius and Applications [PDF]
, 2006 The main aim of the present paper is to establish various sharp upper bounds for the Euclidean operator radius of an n−tuple of bounded linear operators on a Hilbert space.
Dragomir, Sever S
core +5 more sources