Results 51 to 60 of about 2,028,246 (339)
On the Laplacian spectral radius of a tree
AbstractLet G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. In this paper, we present a sharp upper bound for the Laplacian spectral radius of a tree in terms of the matching number and number of vertices, and deduce from that the largest few Laplacian spectral radii over the ...
Ji‐Ming Guo
openalex +3 more sources
Continuity of the cone spectral radius [PDF]
This paper concerns the question whether the cone spectral radius of a continuous compact order-preserving homogenous map on a closed cone in Banach space depends continuously on the map. Using the fixed point index we show that if there exist points not in the cone spectrum arbitrarily close to the cone spectral radius, then the cone spectral radius ...
Roger D. Nussbaum, Bas Lemmens
openaire +3 more sources
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs
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
On Extremal Spectral Radii of Uniform Supertrees with Given Independence Number
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
Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
20 pages, 6 ...
Wenxi Hong, Lihua You
openaire +3 more sources
On the joint spectral radius. II [PDF]
In this paper we show that if T = ( T 1 , … , T n ) {\mathbf {T}} = ({T_1}, \ldots ,{T_n}) is a commuting n n -tuple of operators ...
Muneo Chō, Tadasi Huruya, Volker Wrobel
openaire +1 more source
The extremal spectral radii of $k$-uniform supertrees
In this paper, we study some extremal problems of three kinds of spectral radii of $k$-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence $Q$-spectral radius). We call a connected and acyclic $k$
Li, Honghai, Qi, Liqun, Shao, Jiayu
core +1 more source
Spectral radius and Hamiltonicity of graphs
Let G be a graph of given order and mu(G) be the largest eigenvalue of its adjacency matrix. We give conditions on mu(G) that imply Hamiltonicity of G and of its complement.
Vladimir Nikiforov, Miroslav Fiedler
openaire +3 more sources
A note on distance spectral radius of trees
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
New Condition of Automatic Continuity of Dense Range Homomorphisms on Jordan – Banach Algebras [PDF]
The following open problem stated that, if T: A⟶B is a dense range homomorphism between Banach algebras A and B such that B is semi-simple. Is T automatically continuous? (see [1]).
RUQAYAH N. BALO+2 more
doaj +1 more source