the reciprocal degree distance (rdd)‎, ‎defined for a connected graph $g$ as vertex-degree-weighted sum of the reciprocal distances‎, ‎that is‎, ‎$rdd(g) =sumlimits_{u,vin v(g)}frac{d_g(u)‎ + ‎d_g(v)}{d_g(u,v)}.$ the reciprocal degree distance is a weight version of the harary index‎, ‎just as the degree distance is a weight version of the wiener index‎. ‎in this paper‎, ‎we present exact formu...

The Minkowski distance is a distance measure that generalizes a wide range of other distances such as the Hamming and the Euclidean distance. In this paper, we develop a generalization of the Minkowski distance by using the induced ordered weighted averaging (IOWA) operator. We will call it the induced Minkowski OWA distance (IMOWAD). Then, we are able to obtain a wider range of distance measur...