On Wiener numbers of polygonal nets

Wai Chee Shiu; Peter Che Bor Lam; Kin Keung Poon

doi:10.1016/S0166-218X(01)00317-1

On Wiener numbers of polygonal nets

Wai Chee Shiu^*, Peter Che Bor Lam, Kin Keung Poon

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

11 Citations (Scopus)

21 Downloads (Pure)

Abstract

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 language	English
Pages (from-to)	251-261
Number of pages	11
Journal	Discrete Applied Mathematics
Volume	122
Issue number	1-3
DOIs	https://doi.org/10.1016/S0166-218X(01)00317-1
Publication status	Published - 15 Oct 2002

User-Defined Keywords

Distance
Graph
Polygonal net
Wiener number

Access to Document

10.1016/S0166-218X(01)00317-1

Cite this

@article{cf3e5d91dec145d79b77c709321f3332,

title = "On Wiener numbers of polygonal nets",

abstract = "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.",

keywords = "Distance, Graph, Polygonal net, Wiener number",

author = "Shiu, {Wai Chee} and Lam, {Peter Che Bor} and Poon, {Kin Keung}",

note = "Funding Information: Partially supported by Research Grant Council Grant, Hong Kong. ",

year = "2002",

month = oct,

day = "15",

doi = "10.1016/S0166-218X(01)00317-1",

language = "English",

volume = "122",

pages = "251--261",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - On Wiener numbers of polygonal nets

AU - Shiu, Wai Chee

AU - Lam, Peter Che Bor

AU - Poon, Kin Keung

N1 - Funding Information: Partially supported by Research Grant Council Grant, Hong Kong.

PY - 2002/10/15

Y1 - 2002/10/15

N2 - 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.

AB - 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.

KW - Distance

KW - Graph

KW - Polygonal net

KW - Wiener number

UR - http://www.scopus.com/inward/record.url?scp=84867935654&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(01)00317-1

DO - 10.1016/S0166-218X(01)00317-1

M3 - Journal article

AN - SCOPUS:84867935654

SN - 0166-218X

VL - 122

SP - 251

EP - 261

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-3

ER -

On Wiener numbers of polygonal nets

Abstract

User-Defined Keywords

Access to Document

Other files and links

Embargoed Document

Fingerprint

Cite this