Minimum total dominating energy of graphs

Abstract

The minimum covering energy Ec (G) and minimum dominating energy ED(G) of a graph are well known problems of
graph theory. The energy of the graph is defined as the sum of the absolute values of the eigen values of the adjacency
matrix. In this paper, we introduced minimum total dominating energy of a Graph and also, we computed minimum total
dominating energy of a Wheel Graph, Star Graph and Complete graph. The Minimum total dominating energy for cycle
graph, path graph, and tadpole graph is determined.