Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances between edges in G , whereas the hyper edge-Wiener index WW e (G) is defined as {\footnotesize WW e (G)=12 W e (G)+12 W 2 e (G) }, where {footnotesize W 2 e (G)=sumlimits leftf,grightsubseteqE(G) d 2 e (f,g) }. In this paper, we present explicit formula for the hyper edge-Wiener index of corona product of two graphs. Also, we use it to determine the hyper edge-Wiener index of some chemical graphs
AbstractThe Wiener index is the sum of distances between all vertex pairs in a connected graph. This...
AbstractIf G is a connected graph, then the distance between two edges is, by definition, the distan...
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 ...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
Abstract. Let G be a simple connected graph. The edge-Wiener index We(G) is the sum of all distances...
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...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
[[abstract]]The vertex-edge Wiener index of a simple connected graph GG is defined as the sum of dis...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
The edge-Wiener index of a simple connected graph G is defined as the sum of distances between all p...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
Let G and H be two graphs. The corona product G o H is obtained by taking one copy of G and |V(G) | ...
Let G be a simple connected graph. The distance between the edges g and f E(G) is defined as the dis...
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 ...
AbstractFor a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum ...
AbstractThe Wiener index is the sum of distances between all vertex pairs in a connected graph. This...
AbstractIf G is a connected graph, then the distance between two edges is, by definition, the distan...
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 ...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
Abstract. Let G be a simple connected graph. The edge-Wiener index We(G) is the sum of all distances...
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...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
[[abstract]]The vertex-edge Wiener index of a simple connected graph GG is defined as the sum of dis...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
The edge-Wiener index of a simple connected graph G is defined as the sum of distances between all p...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
Let G and H be two graphs. The corona product G o H is obtained by taking one copy of G and |V(G) | ...
Let G be a simple connected graph. The distance between the edges g and f E(G) is defined as the dis...
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 ...
AbstractFor a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum ...
AbstractThe Wiener index is the sum of distances between all vertex pairs in a connected graph. This...
AbstractIf G is a connected graph, then the distance between two edges is, by definition, the distan...
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 ...