Edge-bandwidth of the triangular grid
From MaRDI portal
Summary: In 1995, \textit{R. Hochberg}, \textit{C. McDiarmid}, and {it M. Saks} [Discrete Math. 138, No.\,1-3, 261--265 (1995; Zbl 0823.05048)] proved that the vertex-bandwidth of the triangular grid \(T_n\) is precisely \(n+1\); more recently \textit{J. Balogh}, \textit{D. Mubayi}, and \textit{A. Pluhár} [Theor. Comput. Sci. 359, No.\,1-3, 43--57 (2006; Zbl 1098.05070)] posed the problem of determining the edge-bandwidth of \(T_n\). We show that the edge-bandwidth of \(T_n\) is bounded above by \(3n-1\) and below by \(3n-o(n)\).
Recommendations
- New bounds on the edge-bandwidth of triangular grids
- Edge-bandwidth of grids and tori
- Bandwidth edge counts for linear arrangements of rectangular grids
- On the bandwidth of triangulated triangles
- Cutwidth of triangular grids
- scientific article; zbMATH DE number 3963886
- On the bandwidth of convex triangulation meshes
- Edge-Bandwidth of Graphs
- Bandwidth and pathwidth of three-dimensional grids
- Edge-isoperimetric inequalities in the grid
Cited in
(7)- On the bandwidth of convex triangulation meshes
- On the bandwidth of triangulated triangles
- Cutwidth of triangular grids
- Bandwidth edge counts for linear arrangements of rectangular grids
- New bounds on the edge-bandwidth of triangular grids
- Bandwidth and pathwidth of three-dimensional grids
- Bandwidth of pyramidal meshes
This page was built for publication: Edge-bandwidth of the triangular grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010627)
