The topographical Wiener index is calculated for two-dimensional graphs describing porous arrays, including bee honeycomb. For tiling in the plane, we model hexagonal, triangular, and square arrays and compare with topological formulas for the Wiener index derived from the distance matrix. The normalized Wiener indices of C4, T13, and O(4), for hexagonal, triangular, and square arrays are 0.993, 0.995, and 0.985, respectively, indicating that the arrays have smaller bond lengths near the center of the array, since these contribute more to the Wiener index. The normalized Perron root (the first eigenvalue, λ1), calculated from distance/distance matrices describes an order parameter, φ = λ1/n, where φ = 1 for a linear graph and n is the order...
The hyper Wiener index of a connected graph $G$ is defined as $WW(G)=\frac{1}{2}\sum_{\{u,v\}\subset...
International audienceDaisy cubes are a class of isometric subgraphs of the hypercubes Q n. Daisy cu...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
We present new calculations for 2D tessellations including the topographical Wiener Index and statis...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a grap...
AbstractWe study distance-based graph invariants, such as the Wiener index, the Szeged index, and va...
: In this article, we have examined the Wiener index in neutrosophic graphs. Wiener index is one of ...
Circulant graphs are an important class of interconnection networks in parallel and distributed comp...
The Wiener index is a topological index defined as the sum of distances between all pairs of vertice...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
Copyright © 2015 Thilakam1 and Sumathi. This is an open access article distributed under the Creativ...
Complex networks abound in physical, biological and social sciences. Quantifying a network's topolog...
Let G=VG,EG be a molecular graph, where VG and EG are the sets of vertices (atoms) and edges (bonds)...
The hyper Wiener index of a connected graph $G$ is defined as $WW(G)=\frac{1}{2}\sum_{\{u,v\}\subset...
International audienceDaisy cubes are a class of isometric subgraphs of the hypercubes Q n. Daisy cu...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...
We present new calculations for 2D tessellations including the topographical Wiener Index and statis...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
The Wiener Index, the sum of distances between all pairs of vertices in a connected graph, is a grap...
AbstractWe study distance-based graph invariants, such as the Wiener index, the Szeged index, and va...
: In this article, we have examined the Wiener index in neutrosophic graphs. Wiener index is one of ...
Circulant graphs are an important class of interconnection networks in parallel and distributed comp...
The Wiener index is a topological index defined as the sum of distances between all pairs of vertice...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
AbstractLet G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal t...
Copyright © 2015 Thilakam1 and Sumathi. This is an open access article distributed under the Creativ...
Complex networks abound in physical, biological and social sciences. Quantifying a network's topolog...
Let G=VG,EG be a molecular graph, where VG and EG are the sets of vertices (atoms) and edges (bonds)...
The hyper Wiener index of a connected graph $G$ is defined as $WW(G)=\frac{1}{2}\sum_{\{u,v\}\subset...
International audienceDaisy cubes are a class of isometric subgraphs of the hypercubes Q n. Daisy cu...
In this paper, we investigate various algebraic and graph theoretic properties of the distance matri...