Abstract
The Wiener number of a connected graph is equal to the sum of distances between all pairs of its vertices. A graph formed by a row of n hexagonal cells is called an n-hexagonal chain. Wiener number of an n × m hexagonal rectangle was found by the authors. An n × m hexagonal jagged-rectangle whose shape forms a rectangle and the number of hexagonal cells in each chain alternate between n and n - 1. In the paper, we obtain the Wiener numbers of three types of n × m hexagonal jagged-rectangles.
Original language | English |
---|---|
Pages (from-to) | 83-96 |
Number of pages | 14 |
Journal | Discrete Applied Mathematics |
Volume | 80 |
Issue number | 1 |
DOIs | |
Publication status | Published - 5 Dec 1997 |
Scopus Subject Areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics
User-Defined Keywords
- Hexagonal jagged-rectangle
- Hexagonal rectangle
- Wiener number