Abstract
The spectral radius and rank of a graph are defined to be the spectral radius and rank of its adjacency matrix, respectively. It is an important problem in spectral extremal graph theory to determine the extremal graph that has the maximum or minimum spectral radius over certain families of graphs. Monsalve and Rada (2021) [8] obtained the extremal graphs with maximum and minimum spectral radii among all graphs with order n and rank 4. In this paper, we first determine the extremal graph which attains the maximum spectral radius among all graphs with any given order n and rank r, and further determine the extremal graph which attains the minimum spectral radius among all graphs with order n and rank 5.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
