Results 31 to 40 of about 66,958 (298)
On the Signless Laplacian Spectral Radius of Graphs without Small Books and Intersecting Quadrangles
In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do not contain small books as a subgraph and characterize all extremal graphs. In addition, we give an upper bound of the signless Laplacian spectral radius of
Ming-Zhu Chen +3 more
doaj +1 more source
Network partition via a bound of the spectral radius [PDF]
12 pages, 10 figures© The author 2016. Published by Oxford University Press. Based on the density of connections between the nodes of high degree, we introduce two bounds of the spectral radius.
Mondragön, RJ, Mondragon-Ceballos, RJ
core +1 more source
Co-spectral radius of intersections [PDF]
We study the behavior of the co-spectral radius of a subgroup H of a discrete group Γ under taking intersections. Our main result is that the co-spectral radius of an invariant random subgroup does not drop upon intersecting with a deterministic co ...
Frączyk, Mikołaj +2 more
core +1 more source
The Aα-spectral radius of complements of bicyclic and tricyclic graphs with n vertices
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
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
Graphs Whose Aα -Spectral Radius Does Not Exceed 2
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
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
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
Optimal network modification for spectral radius dependent phase transitions
The dynamics of contact processes on networks is often determined by the spectral radius of the networks adjacency matrices. A decrease of the spectral radius can prevent the outbreak of an epidemic, or impact the synchronization among systems of coupled
Yonatan Rosen +2 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

