ON DOMINATING SOMBOR ENERGY OF A GRAPH

Abstract

In graph theory, a set of vertices D ⊆ V (G) in a simple graph
G is termed a dominating set if every vertex not in D is adjacent to at
least one member of D, formally expressed as N[D] = V (G). This work
bridges these two concepts such as domination and topological indices. We establish several bounds for this new graph invariant. The paper concludes by demonstrating potential applications of new dominating energy in the field of chemistry