Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
