AbstractThe Wiener number of a molecular graph, or more generally of a connected graph, is equal to the sum of distances between all pairs of its vertices. A graph formed by a hexagon in the centre, surrounded by n rings of hexagonal cells, is called an n-hexagonal net. It is shown that the Wiener number of an n-hexagonal net equals 15(164n5 − 30n3 + n)
The Wiener number of a graph G is defined as 1/2∑d(u,v), where u,v ∈ V(G), and d is the distance fun...
The Wiener number of a graph G is dened as 12 P u;v2V (G) d(u; v), d the distance function on G. The...
The distance d(u, v|G) between the vertices u and v of a (con-nected) graph G is the length ( = numb...
AbstractThe Wiener number of a molecular graph, or more generally of a connected graph, is equal to ...
AbstractThe Wiener number of a connected graph is equal to the sum of distances between all pairs of...
AbstractThe Wiener number W(G) of a graph G is the sum of distances between all pairs of vertices of...
In the drug design process, one wants to construct chemical compounds with certain properties. In or...
In the drug design process, one wants to construct chemical compounds with certain properties. In or...
The Wiener number of a graph G is defined as $1/2 ∑_{u,v ∈ V(G)} d(u,v)$, d the distance function on...
[[abstract]]The Wiener index, or the Wiener number, also known as the “sum of distances” of a connec...
AbstractIn the drug design process, one wants to construct chemical compounds with certain propertie...
In the drug design process, one wants to construct chemical compounds with cer-tain properties. In o...
651-661The Wiener number (W) is equal to the some of distances between all pairs of vertices of the ...
The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a grap...
The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a grap...
The Wiener number of a graph G is defined as 1/2∑d(u,v), where u,v ∈ V(G), and d is the distance fun...
The Wiener number of a graph G is dened as 12 P u;v2V (G) d(u; v), d the distance function on G. The...
The distance d(u, v|G) between the vertices u and v of a (con-nected) graph G is the length ( = numb...
AbstractThe Wiener number of a molecular graph, or more generally of a connected graph, is equal to ...
AbstractThe Wiener number of a connected graph is equal to the sum of distances between all pairs of...
AbstractThe Wiener number W(G) of a graph G is the sum of distances between all pairs of vertices of...
In the drug design process, one wants to construct chemical compounds with certain properties. In or...
In the drug design process, one wants to construct chemical compounds with certain properties. In or...
The Wiener number of a graph G is defined as $1/2 ∑_{u,v ∈ V(G)} d(u,v)$, d the distance function on...
[[abstract]]The Wiener index, or the Wiener number, also known as the “sum of distances” of a connec...
AbstractIn the drug design process, one wants to construct chemical compounds with certain propertie...
In the drug design process, one wants to construct chemical compounds with cer-tain properties. In o...
651-661The Wiener number (W) is equal to the some of distances between all pairs of vertices of the ...
The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a grap...
The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a grap...
The Wiener number of a graph G is defined as 1/2∑d(u,v), where u,v ∈ V(G), and d is the distance fun...
The Wiener number of a graph G is dened as 12 P u;v2V (G) d(u; v), d the distance function on G. The...
The distance d(u, v|G) between the vertices u and v of a (con-nected) graph G is the length ( = numb...
DOI
Add to ORKG