Indeks Weiner dari suatu graf G, yang dinotasikan dengan W(G) adalah jumlahan jarak antara semua pasangan (tak terurut) dari titik-titik G. Pada artikel ini, kami mendapatkan indeks Weiner dari graf… Expand

The terminal Wiener index of a graph is defined as the sum of the distances between the pendent vertices of a graph. In this paper we obtain results for the terminal Wiener index of line graphs.

Let \(A(G)\) be the adjacency matrix of a graph \(G\). Denote by \(s(v)\) the row of the adjacency matrix corresponding to the vertex \(v\) of \(G\). It is a string in the set \({\Bbb Z}_2^n\) of all… Expand

Let F1 be the 5-vertex path, F2 the graph obtained by identifying a vertex of a triangle with one end vertex of the 3-vertex path and F3 the graph obtained by identifying a vertex of a triangle with… Expand

The terminal Hosoya polynomial of a graph is defined as , where is the number of pairs of pendant vertices of that are at distance . In this paper we obtain terminal Hosoya polynomial of line graphs.

Let A(G) be the adjacency matrix of a graph G. The rows of A(G) corresponding to a vertex v of G, denoted by s(v) is the string which belongs to n Z 2 , a set of n-tuples. The Hamming distance… Expand

The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex… Expand