Results 31 to 40 of about 67,270 (298)
The Laplacian spectral radius of graphs [PDF]
, 2010 summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we improve Shi's upper bound for the Laplacian spectral radius of irregular graphs and present some new bounds for the Laplacian
Jianxi Li +5 more
core +1 more source
Network partition via a bound of the spectral radius [PDF]
, 2016 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
Some inequalities on the spectral radius of nonnegative tensors
Open Mathematics, 2020 The eigenvalues and the spectral radius of nonnegative tensors have been extensively studied in recent years. In this paper, we investigate the analytic properties of nonnegative tensors and give some inequalities on the spectral radius.
Ma Chao +3 more
doaj +1 more source
Co-spectral radius of intersections [PDF]
, 2023 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
On the Signless Laplacian Spectral Radius of Graphs without Small Books and Intersecting Quadrangles
Mathematics, 2022 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
Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order [PDF]
, 2010 For every integer n≥4, it is proved that there is a unique graph of order n which maximizes the spectral radius of the unoriented Laplacian matrix over all bicyclic graphs of order n, namely, the graph obtained from the cycle C 4 by first adding a chord ...
Fan, Yi-zheng; 譚必信; Tam, Bit-shun; Zhou, Jun
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
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
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