The second largest eigenvalue upper bound for the canonical genetic algorithms

Author(s):  
Parag C. Pendharkar
2019 ◽  
Vol 11 (06) ◽  
pp. 1950070
Author(s):  
Shuang Zhang ◽  
Yan Zhu

For a real number [Formula: see text], the [Formula: see text]-matrix of a graph [Formula: see text] is defined to be [Formula: see text] where [Formula: see text] and [Formula: see text] are the adjacency matrix and degree diagonal matrix of [Formula: see text], respectively. The [Formula: see text]-spectral radius of [Formula: see text], denoted by [Formula: see text], is the largest eigenvalue of [Formula: see text]. In this paper, we consider the upper bound of the [Formula: see text]-spectral radius [Formula: see text], also we give some upper bounds for the second largest eigenvalue of [Formula: see text]-matrix.


2021 ◽  
Vol 10 (1) ◽  
pp. 131-152
Author(s):  
Stephen Drury

Abstract We discuss the question of classifying the connected simple graphs H for which the second largest eigenvalue of the signless Laplacian Q(H) is ≤ 4. We discover that the question is inextricable linked to a knapsack problem with infinitely many allowed weights. We take the first few steps towards the general solution. We prove that this class of graphs is minor closed.


2016 ◽  
pp. n/a-n/a
Author(s):  
Weijia Xue ◽  
Tingting Lin ◽  
Xin Shun ◽  
Fenglei Xue ◽  
Xuejia Lai

1995 ◽  
Vol 138 (1-3) ◽  
pp. 213-227 ◽  
Author(s):  
Dragoš Cvetković ◽  
Slobodan Simić

Author(s):  
Drasko Tomic ◽  
Karolj Skala ◽  
Lado Kranjcevic ◽  
Boris Pirkic ◽  
Sanja Stifter ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document