On Randic Energy of Graphs

71 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On Randić energy (2014, background): “5 in [10], we arrive at G ∼= Kn or G ∼= SRG ( n, r, r(r−1) n−1 , r(r−1) n−1 ) , as the graphs for which equality in (15) is attained.”