the reverse degree distance of a connected graph $g$ is defined in discrete mathematical chemistry as [ r (g)=2(n-1)md-sum_{uin v(g)}d_g(u)d_g(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $g$, respectively, $d_g(u)$ is the degree of vertex $u$, $d_g(u)$ is the sum of distance between vertex $u$ and all other vertices of $g$, and $v(g)$ is the ...

We study convergence properties of the resistance distance on random geometric graphs for increasing sample size. It turns out that the suitably scaled resistance distance between two fixed points converges to a non-trivial limit. However, this limit no longer takes into account global properties of the graph, as for example the cluster structure. Quite to the opposite, the limit distance funct...

the corona product $gcirc h$ of two graphs $g$ and $h$ isobtained by taking one copy of $g$ and $|v(g)|$ copies of $h$;and by joining each vertex of the $i$-th copy of $h$ to the$i$-th vertex of $g$, where $1 leq i leq |v(g)|$. in thispaper, exact formulas for the eccentric distance sum and the edgerevised szeged indices of the corona product of graphs arepresented. we also study the conditions...

edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.