Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
POURFARAJ,L . (2013). Reciprocal Degree Distance of Grassmann Graphs. Iranian Journal of Mathematical Chemistry, 4(2), 249-255. doi: 10.22052/ijmc.2013.5300
MLA
POURFARAJ,L . "Reciprocal Degree Distance of Grassmann Graphs", Iranian Journal of Mathematical Chemistry, 4, 2, 2013, 249-255. doi: 10.22052/ijmc.2013.5300
HARVARD
POURFARAJ L. (2013). 'Reciprocal Degree Distance of Grassmann Graphs', Iranian Journal of Mathematical Chemistry, 4(2), pp. 249-255. doi: 10.22052/ijmc.2013.5300
CHICAGO
L POURFARAJ, "Reciprocal Degree Distance of Grassmann Graphs," Iranian Journal of Mathematical Chemistry, 4 2 (2013): 249-255, doi: 10.22052/ijmc.2013.5300
VANCOUVER
POURFARAJ L. Reciprocal Degree Distance of Grassmann Graphs. Iranian J. Math. Chem.. 2013;4(2):249-255. doi: 10.22052/ijmc.2013.5300
