Degree-based energies of commuting graph for dihedral groups

Commuting graph for a finite group $G$, denoted by $\Gamma_G$, with its set of vertices $G\backslash Z(G)$, where $Z(G)$ is the center of $G$, is a graph with $v_p,v_q \in G \backslash Z(G)$, $v_p \neq v_q$, are adjacent whenever $v_p v_q = v_q v_p$.  In recent years, there has been significant research into the energy of graphs, particularly focusing on matrices associated with the degree of vertices.  Therefore, motivated by that, our study elaborates on the energy of $\Gamma_G$ for dihedral groups of order $2n$, $D_{2n}$, concerning some graph matrices related to the degree of elements of $D_{2n}\backslash Z(D_{2n})$ and examine the correlation between those energies.  The matrices involved are known as geometric-arithmetic, symmetric division deg, degree exponent, inverse sum indeg and Sombor matrices. Based on these five matrices, it is found that the lowest graph energy is the geometric-arithmetic energy of $\Gamma_G$ whilst the highest is the degree exponent energy.  Furthermore, the geometric-arithmetic, symmetric division deg, and degree exponent energies are always positive even integers.  In contrast, the inverse sum indeg energy is a positive integer that can be either even or odd. Meanwhile, the Sombor energy is never an odd integer.