The spectral radius of graphs with given independence number

2022 ◽  
Vol 345 (4) ◽  
pp. 112778
Author(s):  
Zhenzhen Lou ◽  
Ji-Ming Guo
Keyword(s):  
Spectral Radius ◽  
Independence Number

scholarly journals New Bounds for the α-Indices of Graphs

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1668
Author(s):  
Eber Lenes ◽  
Exequiel Mallea-Zepeda ◽  
Jonnathan Rodríguez
Keyword(s):  
Lower Bound ◽  
Spectral Radius ◽  
Upper Bound ◽  
Adjacency Matrix ◽  
Independence Number ◽  
Minimal Degree ◽  
Diagonal Matrix ◽  
The Matrix

Let G be a graph, for any real 0≤α≤1, Nikiforov defines the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), where A(G) and D(G) are the adjacency matrix and diagonal matrix of degrees of the vertices of G. This paper presents some extremal results about the spectral radius ρα(G) of the matrix Aα(G). In particular, we give a lower bound on the spectral radius ρα(G) in terms of order and independence number. In addition, we obtain an upper bound for the spectral radius ρα(G) in terms of order and minimal degree. Furthermore, for n>l>0 and 1≤p≤⌊n−l2⌋, let Gp≅Kl∨(Kp∪Kn−p−l) be the graph obtained from the graphs Kl and Kp∪Kn−p−l and edges connecting each vertex of Kl with every vertex of Kp∪Kn−p−l. We prove that ρα(Gp+1)<ρα(Gp) for 1≤p≤⌊n−l2⌋−1.

scholarly journals The minimum spectral radius of graphs with a given independence number

2009 ◽  
Vol 431 (5-7) ◽  
pp. 937-945 ◽  
Author(s):  
Mimi Xu ◽  
Yuan Hong ◽  
Jinlong Shu ◽  
Mingqing Zhai
Keyword(s):  
Spectral Radius ◽  
Independence Number
Sign in / Sign up

Export Citation Format

Share Document