Results 31 to 40 of about 479,399 (272)

The extremal spectral radii of $k$-uniform supertrees

open access: yes, 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

open access: yesJournal 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

The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs

open access: yesAKCE 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

Continuity properties of the lower spectral radius

open access: yes, 2014
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

On the Joint Spectral Radius

open access: yes, 2022
minor additions, 15 pages, to be submitted to a Springer volume in memory of Jean ...
openaire   +2 more sources

A note on distance spectral radius of trees

open access: yesSpecial Matrices, 2017
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

open access: yesDiscussiones 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

Optimal network modification for spectral radius dependent phase transitions

open access: yesNew Journal of Physics, 2016
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

A toy model for X-ray spectral variability of active galactic nuclei

open access: yes, 2014
The long term X-ray spectral variability of ten active galactic nuclei (AGN) shows a positive spectral index-flux correlation for each object (Sobolewska & Papadakis 2009).
Cao, Xinwu, Wang, Jun-Xian
core   +1 more source

Spectral radius and signless Laplacian spectral radius of strongly connected digraphs

open access: yesLinear Algebra and its Applications, 2014
20 pages, 6 ...
Wenxi Hong, Lihua You
openaire   +3 more sources

Home - About - Disclaimer - Privacy