The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a graph invariant much studied in both mathematical and chemical literature.Topological graph indices are introduced as mathematical tools for molecule descriptions. Recently, they were computed not only for graphs representing molecules, but for other regular structured graphs including some 2 and 3 dimensional structures. The Carbon atoms in the diamond are arranged in a well defined structure. In this paper, the graph of this structure is analysed, especially, the connected part of a sequence of unit cells. The Wiener index, as the sum of the distances for every pair of atoms is computed, a closed formula depending only on the number of unit cel...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
Copyright © 2015 Thilakam1 and Sumathi. This is an open access article distributed under the Creativ...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a grap...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
Abstract. The Wiener index is one of the oldest molecular-graph-based structure-descriptors. It was ...
AbstractThe Wiener index is the sum of distances between all vertex pairs in a connected graph. This...
The Wiener index is a topological index defined as the sum of distances between all pairs of vertice...
The Wiener index is one of the oldest molecular-graph-based structure-descriptors. It was first prop...
The classical Wiener index, W(G), is equal to the sum of the distances between all pairs of vertexes...
Let G=VG,EG be a molecular graph, where VG and EG are the sets of vertices (atoms) and edges (bonds)...
AbstractFor a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum ...
AbstractLet G be a molecular graph. The Wiener indices of G are defined as the sum of the shortest p...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
Abstract. A topological representation of a molecule is called molecular graph. A molecular graph is...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
Copyright © 2015 Thilakam1 and Sumathi. This is an open access article distributed under the Creativ...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a grap...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
Abstract. The Wiener index is one of the oldest molecular-graph-based structure-descriptors. It was ...
AbstractThe Wiener index is the sum of distances between all vertex pairs in a connected graph. This...
The Wiener index is a topological index defined as the sum of distances between all pairs of vertice...
The Wiener index is one of the oldest molecular-graph-based structure-descriptors. It was first prop...
The classical Wiener index, W(G), is equal to the sum of the distances between all pairs of vertexes...
Let G=VG,EG be a molecular graph, where VG and EG are the sets of vertices (atoms) and edges (bonds)...
AbstractFor a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum ...
AbstractLet G be a molecular graph. The Wiener indices of G are defined as the sum of the shortest p...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
Abstract. A topological representation of a molecule is called molecular graph. A molecular graph is...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
Copyright © 2015 Thilakam1 and Sumathi. This is an open access article distributed under the Creativ...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...