Results 31 to 40 of about 478,134 (315)
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
On spectral radius algebras [PDF]
Operators and Matrices, 2008 We show how one can associate a Hermitian operator P to every operator A , and we prove that the invertibility properties of P imply the non-transitivity and density of the spectral radius algebra associated to A . In the finite dimensional case we give a complete characterization of these algebras in terms of P .
Biswas, Animikh +3 more
openaire +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
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
Spectral radius of bipartite graphs
Linear Algebra and its Applications, 2015 Let k, p, q be positive integers with k < p < q+1. We prove that the maximum spectral radius of a simple bipartite graph obtained from the complete bipartite graph Kp,q of bipartition orders p and q by deleting k edges is attained when the deleting edges are all incident on a common vertex which is located in the partite set of order q.
Liu, Chia-an, Weng, Chih-wen
openaire +3 more sources
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 extremal spectral radii of $k$-uniform supertrees
, 2014 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
Cliques and the spectral radius
Journal of Combinatorial Theory, Series B, 2007 We present a number of relations involving the number of cliques in a graph and its spectral radius.
Bollobás, Béla, Nikiforov, Vladimir
openaire +2 more sources
, 2015 In this paper, we show the evaluation of the spectral radius for node degree as the basis to analyze the variation in the node degrees during the evolution of scale-free networks and small-world networks.
Meghanathan, Natarajan
core +1 more source
, 2022 minor additions, 15 pages, to be submitted to a Springer volume in memory of Jean ...
openaire +2 more sources