AbstractThe hyper Wiener index of the connected graph G is WW(G)=12∑{u,v}⊆V(G)(d(u,v)+d(u,v)2), where d(u,v) is the distance between the vertices u and v of G. In this paper we compute the hyper-Wiener index of the generalized hierarchical product of two graphs and give some applications of this operation
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
Let G1 = (V1, E1) and G2 = (V2, E2) be two graphs having a distinguished or root vertex, labeled 0. ...
AbstractThe kth power of a graph G, denoted by Gk, is a graph with the same vertex set as G such tha...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
AbstractWe determine the Wiener index of graphs which are constructed by some operations such as Myc...
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 ...
Abstract. Let G be a simple connected graph. The edge-Wiener index We(G) is the sum of all distances...
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 ...
The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemic...
AbstractWe determine the Wiener index of graphs which are constructed by some operations such as Myc...
Let G be a connected graph and u and v two vertices of G. The hyper-Wiener index of graph G is WW(G)...
The Wiener index, denoted by W(G), of a connected graph G is the sum of all pairwise distances of ve...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
Let G1 = (V1, E1) and G2 = (V2, E2) be two graphs having a distinguished or root vertex, labeled 0. ...
AbstractThe kth power of a graph G, denoted by Gk, is a graph with the same vertex set as G such tha...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances betwe...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
AbstractWe determine the Wiener index of graphs which are constructed by some operations such as Myc...
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 ...
Abstract. Let G be a simple connected graph. The edge-Wiener index We(G) is the sum of all distances...
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 ...
The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemic...
AbstractWe determine the Wiener index of graphs which are constructed by some operations such as Myc...
Let G be a connected graph and u and v two vertices of G. The hyper-Wiener index of graph G is WW(G)...
The Wiener index, denoted by W(G), of a connected graph G is the sum of all pairwise distances of ve...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
Let G1 = (V1, E1) and G2 = (V2, E2) be two graphs having a distinguished or root vertex, labeled 0. ...
AbstractThe kth power of a graph G, denoted by Gk, is a graph with the same vertex set as G such tha...
DOI
Add to ORKG