ABSTRACT
Let G be a simple undirected connected graph. In this article, we find bounds on the Reciprocal Distance Energy, Reciprocal Distance Laplacian Energy and Reciprocal Distance signless Laplacian Energy. Furthermore, we characterized the graphs that attained some of those bounds.
Acknowledgements
The authors would like to thank the referee for his/her constructive suggestions that improved the final version of this paper. M. Trigo thank the Program ‘Magister en Ciencias mención Matemática Aplicada’ of the Universidad de Antofagasta. Part of this research was conducted in ‘Coloquio de Matemática’ code CR-4486, of the Universidad de Antofagasta, Chile.
Disclosure statement
No potential conflict of interest was reported by the author(s).