On the bandwidth of convex triangulation meshes

DOI10.1016/S0012-365X(97)00063-0zbMATH Open0880.05075OpenAlexW2076203145MaRDI QIDQ1367046FDOQ1367046

Authors: Bernhard Rupp 

Publication date: 17 September 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00063-0

Recommendations

• Bandwidth of pyramidal meshes
• On the bandwidth of triangulated triangles
• Edge-bandwidth of the triangular grid
• New bounds on the edge-bandwidth of triangular grids

zbMATH Keywords

bandwidth of triangulated trianglesconvex triangulation meshes

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Optimal numberings and isoperimetric problems on graphs
• Optimal labelling of a product of two paths
• The bandwidth problem for graphs and matrices—a survey
• On the bandwidth of triangulated triangles

Cited In (7)

• Bandwidth and pathwidth of three-dimensional grids
• Edge-bandwidth of the triangular grid
• On Wiener numbers of polygonal nets
• Antibandwidth of Three-Dimensional Meshes
• Bandwidth of pyramidal meshes
• On the bandwidth of triangulated triangles
• New results on edge-bandwidth

This page was built for publication: On the bandwidth of convex triangulation meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367046)