Graph descriptors such as normalized Laplacian energy, Sombor index, Mostar index and Zagreb index are often employed in various scientific contexts. The Sombor index is essential in chemical graph theory because it provides insights into molecule stability and reactivity by analyzing the distribution of atom degrees and distances. By measuring molecular graph topology, the Zagreb indices are vital tools in mathematical chemistry that help predict molecules' physical and chemical characteristics. This manuscript aims to broaden the characterization of extremal graphs, achieving upper sharp bounds for the Mostar and first Zagreb index with given parameters such as cut edges and girth. Let \( \chi_{n}^{k} \) be the set of all \( n \)-vertex graphs with exact chromatic number \( k \). Das and Shang characterized graphs achieving the maximum Sombor index of graphs in \( \chi_{n}^{k} \) in terms of chromatic number. This paper extends the characterized graphs, achieving the minimum Sombor of graphs in \( \chi_{n}^{k} \) in terms of chromatic number. Furthermore, by employing Rayleigh's quotient principle, we present a first-ever comparison between the normalized Laplacian energy and the Sombor and first Zagreb indices in terms of eigenvalues. To extend our results, we suggest some open problems to contribute in the direction of extremal graph theory.