Results 21 to 30 of about 1,644,718 (204)
Spectral radius of S-essential spectra
Математичні Студії, 2020 In this paper, we study the spectral radius of some S-essential spectra of a bounded linear operator defined on a Banach space. More precisely, via the concept of measure of noncompactness,we show that for any two bounded linear operators $T$ and $S ...
C. Belabbaci
doaj +1 more source
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
Spectral Radius, Edge-Disjoint Cycles and Cycles of the Same Length [PDF]
Electronic Journal of Combinatorics, 2021 In this paper, we provide spectral conditions for the existence of two edge-disjoint cycles and two cycles of the same length in a graph, which can be viewed as the spectral analogues of Erdős and Posa's condition and Erdős' classic problem about the ...
Huiqiu Lin, M. Zhai, Yanhua Zhao
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
Automatic Continuity of Dense Range Homomorphisms into Multiplicatively Semisimple Complete Normed Algebras [PDF]
مجلة التربية والعلم, 2014 The following open problem state that: If is a dense range homomorphism from Banach algebra into Banach algebra such that is semisimple. Is automatically continuous?
RUQAYAH BALO
doaj +1 more source
Some sufficient conditions on hamilton graphs with toughness
Frontiers in Computational Neuroscience, 2022 Let G be a graph, and the number of components of G is denoted by c(G). Let t be a positive real number. A connected graph G is t-tough if tc(G − S) ≤ |S| for every vertex cut S of V(G). The toughness of G is the largest value of t for which G is t-tough,
Gaixiang Cai +4 more
doaj +1 more source
The Maximum Spectral Radius of Graphs Without Friendship Subgraphs
Electronic Journal of Combinatorics, 2020 A graph on $2k+1$ vertices consisting of $k$ triangles which intersect in exactly one common vertex is called a $k-$friendship graph and denoted by $F_k$.
S. Cioabă +3 more
semanticscholar +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
Spectral Radius Formulas Involving Generalized Aluthge Transform
Journal of Function Spaces, 2022 In this paper, we aim to develop formulas of spectral radius for an operator S in terms of generalized Aluthge transform, numerical radius, iterated generalized Aluthge transform, and asymptotic behavior of powers of S.
Zhiqiang Zhang +4 more
doaj +1 more source