On the sum of all distances in composite graphs
Discrete Mathematics
The Wiener number of the hexagonal net
Discrete Applied Mathematics
Clin d'oeil on L1-embeddable planar graphs
Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
Wiener number of hexagonal jagged-rectangles
Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
On the bandwidth of convex triangulation meshes
Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
Hi-index | 0.04 |
The Wiener number of a connected graph is equal to the sum of distances between all pairs of its vertices. In this paper, we shall generalize the elementary cuts method to homogeneous n-gonal nets and give a formula to calculate the Wiener numbers of irregular convex triangular hexagons.