Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs

Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating set of a graph G, our aim in this paper is to define and study the so called minimum dominating distance signless Laplacian matrix, denoted by MDD^{Q}(G). We study some properties of the matrix MDD^{Q}(G). We also define the minimum dominating distance signless Laplacian energy of a graph G, denoted by EDD^{Q}(G), as the sum of the absolute values of the eigenvalues of MDD^{Q}(G), and give some upper and lower bounds for the energy and spectral radius of MDD^{Q}(G).