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 function on G. The Wiener number has important applications in chemistry. We determine the Wiener number of an important family of graphs, namely, the Kneser graphs
AbstractIn the drug design process, one wants to construct chemical compounds with certain propertie...
AbstractThe Wiener number of a molecular graph, or more generally of a connected graph, is equal to ...
Abstract. The Wiener index is one of the oldest molecular-graph-based structure-descriptors. It was ...
The Wiener number of a graph G is defined as $1/2 ∑_{u,v ∈ V(G)} d(u,v)$, d the distance function on...
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...
AbstractThe Wiener number W(G) of a graph G is the sum of distances between all pairs of vertices of...
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,...
651-661The Wiener number (W) is equal to the some of distances between all pairs of vertices of the ...
AbstractThe Wiener number is the sum of distances between all pairs of vertices of a connected graph...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
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...
AbstractThe Wiener number, W(G), is the sum of the distances of all pairs of vertices in a graph G. ...
The Wiener index of W(G) is G equal to the sum of distances between all pairs of vertices of G.The W...
The Wiener index of W(G) is G equal to the sum of distances between all pairs of vertices of G.The W...
AbstractIn the drug design process, one wants to construct chemical compounds with certain propertie...
AbstractThe Wiener number of a molecular graph, or more generally of a connected graph, is equal to ...
Abstract. The Wiener index is one of the oldest molecular-graph-based structure-descriptors. It was ...
The Wiener number of a graph G is defined as $1/2 ∑_{u,v ∈ V(G)} d(u,v)$, d the distance function on...
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...
AbstractThe Wiener number W(G) of a graph G is the sum of distances between all pairs of vertices of...
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,...
651-661The Wiener number (W) is equal to the some of distances between all pairs of vertices of the ...
AbstractThe Wiener number is the sum of distances between all pairs of vertices of a connected graph...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
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...
AbstractThe Wiener number, W(G), is the sum of the distances of all pairs of vertices in a graph G. ...
The Wiener index of W(G) is G equal to the sum of distances between all pairs of vertices of G.The W...
The Wiener index of W(G) is G equal to the sum of distances between all pairs of vertices of G.The W...
AbstractIn the drug design process, one wants to construct chemical compounds with certain propertie...
AbstractThe Wiener number of a molecular graph, or more generally of a connected graph, is equal to ...
Abstract. The Wiener index is one of the oldest molecular-graph-based structure-descriptors. It was ...
DOI
Add to ORKG