the edge versions of reverse wiener indices were introduced by mahmiani et al. veryrecently. in this paper, we find their relation with ordinary (vertex) wiener index in somegraphs. also, we compute them for trees and tuc4c8(s) naotubes.

the degree kirchhoff index of a connected graph $g$ is defined as‎ ‎the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices‎, ‎where $d_i$ is the‎ ‎degree of the $i$-th vertex‎, ‎and $r_{ij}$ the resistance distance between the $i$-th and‎ ‎$j$-th vertex of $g$‎. ‎bounds for the degree kirchhoff index of the line and para-line‎ ‎graphs are determined‎. ‎the special case of regular grap...

Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this...

The diameter of an undirected unweighted graph G = (V,E) is the maximum value of the distance from any vertex u to another vertex v for u, v ∈ V where distance i.e. d(u, v) is the length of the shortest path from u to v in G. DAG, is a directed graph without a cycle. We denote the diameter of an unweighted DAG G = (V,E) by δ(G). The stretch of a DAG G is the length of longest path from u to v i...

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

Let D be a connected balanced digraph. The classical distance dijD from vertex i to j is the length of shortest directed path in D. L Laplacian matrix and L†=(lij†) Moore–Penrose inverse L. resistance rijD then defined by rijD≔lii†+ljj†−2lij†. C collection digraphs, each member which finite union form D1∪D2∪....∪Dk where Dt digraph with Dt∩(D1∪D2∪⋯∪Dt−1) being single vertex, for all 1<t≤k. In t...

This paper deals with the problem of coloring a two-dimensional segmentation result in such a way that each segment has a different color with the constraint that adjacent segments have sufficiently distinct colors to be easily distinguishable by a human viewer. Our solution for this problem is based on a balanced coloring of the neighborhood graph built from the area Voronoi diagram. The balan...