The minimal spectral radius with given independence number

From MaRDI portal
(Redirected from Publication:6185801)



Abstract: In this paper, we determine the graphs which have the minimal spectral radius among all the connected graphs of order n and the independence number lceilfracn2ceil−1.


The authors show that among simple connected graphs with \(n\) vertices and the independence number \(\lceil n/2\rceil-1\), the minimum spectral radius of adjacency matrix is attained for the cycle when \(n\) is odd, and when \(n\) is even, then for a graph obtained by joining two cycles on approximately \(n/3\) vertices by a path of length approximately \(n/3\), where the exact lengths of the cycles and the path further depend on the value of \(n\) modulo 6.











This page was built for publication: The minimal spectral radius with given independence number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185801)