Abstract:Let G n,α be the set of connected graphs with order n and independence number α. Given k = n − α, the graph with minimum spectral radius among G n,α is called the minimizer graph. Stevanović in the classical book [D. Stevanović, Spectral Radius of Graphs, Academic Press, Amsterdam, 2015.] pointed that determining minimizer graph in G n,α appears to be a tough problem on page 96. Very recently, Lou and Guo in [15] proved that the minimizer graph of G n,α must be a tree if α ≥ ⌈ n 2 ⌉. In this paper, we furthe… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.