Minimum Roman Dominating Distance Energy of a Graph
Combinatorics
2022-04-01 v1 Information Theory
math.IT
Abstract
In this correspondence, we introduced the concept of minimum roman dominating distance energy of a graph 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 Finally, we derived the Upper and lower bounds for
Cite
@article{arxiv.2203.16805,
title = {Minimum Roman Dominating Distance Energy of a Graph},
author = {Lakshmanan R and N. Annamalai},
journal= {arXiv preprint arXiv:2203.16805},
year = {2022}
}