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}.
Original language | English |
---|---|
Pages (from-to) | 285-289 |
Number of pages | 5 |
Journal | Discrete Mathematics |
Volume | 173 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 20 Aug 1997 |
Scopus Subject Areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
User-Defined Keywords
- Bandwidth
- Connecting set
- Convex triangulation mesh
- Triangulated triangles