Results 31 to 40 of about 477,790 (171)
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
A note on distance spectral radius of trees
Special 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
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
, 2022 minor additions, 15 pages, to be submitted to a Springer volume in memory of Jean ...
openaire +2 more sources
Optimal network modification for spectral radius dependent phase transitions
New 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
, 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
Spectral Sufficient Conditions on Pancyclic Graphs
Complexity, 2021 A pancyclic graph of order n is a graph with cycles of all possible lengths from 3 to n. In fact, it is NP-complete that deciding whether a graph is pancyclic.
Guidong Yu +3 more
doaj +1 more source
Continuity properties of the lower spectral radius
, 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
Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
Linear Algebra and its Applications, 2014 20 pages, 6 ...
Wenxi Hong, Lihua You
openaire +3 more sources