The Randi? index R(G) of a graph G is defined as the sum of the weights (dG(u)dG(v))-1/2 over all edges e = uv of G. In this paper we have obtained the Randi? index of some class of trees and of their complements. Also further developed an algorithmic technique to find Randi? index of a graph.
@artical{h592016ijcatr05091006,
Title = "Randi? Index of Some Class of Trees with an Algorithm",
Journal ="International Journal of Computer Applications Technology and Research (IJCATR)",
Volume = "5",
Issue ="9",
Pages ="590 - 594",
Year = "2016",
Authors ="H. S. Ramane
R. B. Jummannaver
V. K. Kyalkonda"}
10.7753/IJCATR0509.1006
Editor/Reviewer login