On the bandwidth of convex triangulation meshes 1

Peter C.B. Lam; W. C. Shiu; W. H. Chan; Y. Lin

doi:10.1016/S0012-365X(97)00063-0

On the bandwidth of convex triangulation meshes 1

Peter C.B. Lam^*
, W. C. Shiu
, W. H. Chan
, Y. Lin

^*Corresponding author for this work

Department of Mathematics

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

7 Citations (Scopus)

Abstract

Hochberg et al. (1995) obtained the bandwidth of triangulated triangles. In this paper, we consider a more general class of graphs, called convex triangulation meshes and denoted by T_l,m,n. We show that the bandwidth of T_l,m,n is min {l,m,n}.

Original language	English
Pages (from-to)	285-289
Number of pages	5
Journal	Discrete Mathematics
Volume	173
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(97)00063-0
Publication status	Published - 20 Aug 1997

User-Defined Keywords

Bandwidth
Connecting set
Convex triangulation mesh
Triangulated triangles

Access to Document

10.1016/S0012-365X(97)00063-0

Cite this

@article{3ccb78507a6f4ecabd9e56376119aaa4,

title = "On the bandwidth of convex triangulation meshes 1",

abstract = "Hochberg et al. (1995) obtained the bandwidth of triangulated triangles. In this paper, we consider a more general class of graphs, called convex triangulation meshes and denoted by Tl,m,n. We show that the bandwidth of Tl,m,n is min \{l,m,n\}.",

keywords = "Bandwidth, Connecting set, Convex triangulation mesh, Triangulated triangles",

author = "Lam, \{Peter C.B.\} and Shiu, \{W. C.\} and Chan, \{W. H.\} and Y. Lin",

note = "Funding Information: supported by FRG, Hong Kong Baptist University.",

year = "1997",

month = aug,

day = "20",

doi = "10.1016/S0012-365X(97)00063-0",

language = "English",

volume = "173",

pages = "285--289",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - On the bandwidth of convex triangulation meshes 1

AU - Lam, Peter C.B.

AU - Shiu, W. C.

AU - Chan, W. H.

AU - Lin, Y.

N1 - Funding Information: supported by FRG, Hong Kong Baptist University.

PY - 1997/8/20

Y1 - 1997/8/20

N2 - Hochberg et al. (1995) obtained the bandwidth of triangulated triangles. In this paper, we consider a more general class of graphs, called convex triangulation meshes and denoted by Tl,m,n. We show that the bandwidth of Tl,m,n is min {l,m,n}.

AB - Hochberg et al. (1995) obtained the bandwidth of triangulated triangles. In this paper, we consider a more general class of graphs, called convex triangulation meshes and denoted by Tl,m,n. We show that the bandwidth of Tl,m,n is min {l,m,n}.

KW - Bandwidth

KW - Connecting set

KW - Convex triangulation mesh

KW - Triangulated triangles

UR - https://www.scopus.com/pages/publications/0039968147

U2 - 10.1016/S0012-365X(97)00063-0

DO - 10.1016/S0012-365X(97)00063-0

M3 - Journal article

AN - SCOPUS:0039968147

SN - 0012-365X

VL - 173

SP - 285

EP - 289

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

On the bandwidth of convex triangulation meshes 1

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this