LAUSR

Let $G\left(n,m\right)$ represent the family of square power graphs of order $n$ and size $m$ , obtained from the family of graphs $F\left(n,k\right)$ of order $n$ and size $k$ , with $m\ge k$ . In this paper, we discussed the least eigenvalue of graph $G$ in the family $G{\left(n,m\right)}^c$ . All graphs considered here are undirected, simple, connected, and not a complete $K_n$ for positive integer $n$ .