Let Gn,m represent the family of square power graphs of order n and size m, obtained from the family of graphs Fn,k of order n and size k, with m≥k. In this paper, we discussed the least eigenvalue of graph G in the family Gn,mc. All graphs considered here are undirected, simple, connected, and not a complete Kn for positive integer n.
