On Wiener numbers of polygonal nets

Wai Chee SHIU*, Peter Che Bor Lam, Kin Keung Poon

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

11 Citations (Scopus)
13 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)251-261
Number of pages11
JournalDiscrete Applied Mathematics
Issue number1-3
Publication statusPublished - 15 Oct 2002

Scopus Subject Areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

User-Defined Keywords

  • Distance
  • Graph
  • Polygonal net
  • Wiener number


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

Cite this