Wiener number of hexagonal jagged-rectangles

Wai Chee SHIU, Chong Sze TONG, P. C.B. Lam*

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

18 Citations (Scopus)


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 languageEnglish
Pages (from-to)83-96
Number of pages14
JournalDiscrete Applied Mathematics
Issue number1
Publication statusPublished - 5 Dec 1997

Scopus Subject Areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

User-Defined Keywords

  • Hexagonal jagged-rectangle
  • Hexagonal rectangle
  • Wiener number


Dive into the research topics of 'Wiener number of hexagonal jagged-rectangles'. Together they form a unique fingerprint.

Cite this