Let G be a 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. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as ( ) ( ) ( ) ( ) ( ) 2 {u,v} V G WW G d v u d v u , , . ∈ = + ∑ Also, the Hosoya polynomial was introduced by H. Hosoya and define ( ) ( ) ( ) , {u,v} V G , . d v u H G x x ∈ = ∑ In this paper, the Hosoya polynomial, Wiener index and Hyper-Wiener index of some regular graphs are determined. Let G be a 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. The Wiener index W(G) is the sum of all distances between ver...
The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemic...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a ...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener ...
Let $ G=(V,E) $ be a simple graph. Hosoya polynomial of G is $ H(G,x)=\sum _{\{u,v\}\subseteq V(G)} ...
For any two distinct vertices u and v in a connected graph G, let lPu,v=lP be the length of u−v pat...
AbstractThe hyper Wiener index of the connected graph G is WW(G)=12∑{u,v}⊆V(G)(d(u,v)+d(u,v)2), wher...
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition...
The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has be...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
This paper is concerned with the strong product of two graphs, and , and bounds on the Wiener inde...
The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemic...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a ...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener ...
Let $ G=(V,E) $ be a simple graph. Hosoya polynomial of G is $ H(G,x)=\sum _{\{u,v\}\subseteq V(G)} ...
For any two distinct vertices u and v in a connected graph G, let lPu,v=lP be the length of u−v pat...
AbstractThe hyper Wiener index of the connected graph G is WW(G)=12∑{u,v}⊆V(G)(d(u,v)+d(u,v)2), wher...
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition...
The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has be...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
This paper is concerned with the strong product of two graphs, and , and bounds on the Wiener inde...
The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemic...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...