Results 21 to 30 of about 479,522 (272)
Some inequalities on the spectral radius of nonnegative tensors
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
Spectral Radius and Hamiltonicity of Graphs
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complement,
Yu Guidong +3 more
doaj +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
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
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
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
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
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
Continuity properties of the lower spectral radius
The lower spectral radius, or joint spectral subradius, of a set of real $d \times d$ matrices is defined to be the smallest possible exponential growth rate of long products of matrices drawn from that set.
Bochi, Jairo, Morris, Ian D.
core +1 more source

