In 1995, the bandwidth of triangulated triangles Tm were found by Hockberg et al . Based on their proofs, Lam et al  obtained the bandwidth of convex triangulated meshes T₁,m,n in 1997. In this paper, we shall consider a three dimensional analogue of triangulated triangles. We shall obtain an upper bound for the bandwidth of TTm and show that this upper bound of the bandwidth of TTm on the “level-by-level” numbering is the best possible. Copyright © 2007 Utilitas Mathematica Pub. Inc.
|Publication status||Published - 2007|
CitationChan, W.-H. (2007). Bandwidth of pyramidal meshes. Congressus Numerantium, 187, 90-96.
- Three-dimensional meshes
- Bandwidth of graphs
- Level-by-level numbering