The degree distance index (DDI) is a vertex-degree weighted version of well-known that called by Wiener (WI). In extremal theory graphs, improving the bounds with best possible values worth investigating problem. this note, exact formulae DDI for four different types sum graphs in terms various indic...

Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.

In this study Jaccard Distance was performed by measuring the asymmetric information on binary variable and the comparison between vectors component. It compared two objects and notified the degree of similarity of these objects. After thorough preprocessing tasks; like translation, rotation, invariance scale content and noise resistance done onto the hand sketch object, Jaccard distance still ...

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...