Maximum Degree Energy and Minimum Degree Energy in the Context of Some Graph Operations
Let 𝐺 be a 𝑘-regular graph on 𝑛 vertices. In this paper, we determine the maximum and minimum degree energies of two specific graph operations: the extended 𝑚-splitting graph. 𝑆𝑝𝑙𝑚∗ (𝐺) and the 𝑚-semi shadow graph 𝑆𝐷𝑚(𝐺). By applying block matrix decompositions and unitary similarity transformations, we express the max...