Consider a group Formula: see text and construct its power graph, whose vertex set consists of the elements of Formula: see text. Two distinct vertices (elements) are adjacent in the graph if and only if one element can be expressed as an integral power of the other. In this article, we improved the bounds of the spectral radius of the power graphs of the cyclic group Formula: see text, the dihedral group Formula: see text, and the dicyclic group Formula: see text. For Formula: see text the power graph of the cyclic group Formula: see text is not a complete multipartite graph. We find the second largest eigenvalue bounds of the same with the clique number. In some cases, we find the bounds are exact if and only if they belong to a particular family of graphs. Lastly, we work on the distance spectral radius of the power graphs of the same groups
Mondal et al. (Fri,) studied this question.