Minimum total dominating energy of cut vertex of some standard graphs

Let H be a simple graph with vertex set V(H) and edge set E(H). In a graph H(V, E), a set of vertices S is named as a total dominating set if all the vertex v ∈ V is adjacent to a component of S. The minimum cardinality of a total dominating set of H is called the total domination number of H which is represented by yt(H). The energy of the graph is calculated as the summation of absoluteivalues of the eigen values of adjacency matrix. In this paper, we calculated least total dominating energy of cut vertex for some standard graphs such as Ladder Graph, Friendship Graph and Tadpole graph. The Least total dominating energy of cut vertex for Wheel graph is also computed.