Characteristic Polynomial & Domination Energy of Some Special Class of Graphs.

Representation of a set of vertices in a graph by means of a matrix was intro- duced by Sampath Kumar. Let G(V,E) be a graph and S ⊆ V be a set of vertices, we can represent the set S by means of a matrix as follows, in the adjacency matrix A(G) of G replace the aii element by 1 if and only if vi ϵ S. In this paper we define set energy and find its properties and also study the special case of set S being a dominating set and corresponding domination energy of some special class of graphs. [ABSTRACT FROM AUTHOR]