On wiener numbers of polygonal nets

Wai Chee SHIU, Che Bor Peter LAM, Kin Keung Eric POON

Research output: Contribution to journalArticlespeer-review

11 Citations (Scopus)


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. Copyright © 2002 Elsevier.
Original languageEnglish
Pages (from-to)251-261
JournalDiscrete Applied Mathematics
Issue number1-3
Publication statusPublished - Oct 2002


Shiu, W. C., Lam, P. C. B., & Poon, K. K. (2002). On wiener numbers of polygonal nets. Discrete Applied Mathematics, 122(1-3), 251-261.


  • Graph
  • Distance
  • Polygonal net
  • Wiener number


Dive into the research topics of 'On wiener numbers of polygonal nets'. Together they form a unique fingerprint.