Minimum Roman Dominating Distance Energy of a Graph

03/31/2022

∙

by   Lakshmanan R, et al.

∙

0

∙

share

In this correspondence, we introduced the concept of minimum roman dominating distance energy E_RDd(G) of a graph G and computed minimum roman dominating distance energy of some standard graphs. Also, we discussed the properties of eigenvalues of a minimum roman dominating distance matrix A_RDd(G). Finally, we derived the Upper and lower bounds for E_RDd(G).