Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs
From MaRDI portal
Publication:3629454
Recommendations
Cited in
(9)- On the bandwidth of a Hamming graph
- Bandwidth edge counts for linear arrangements of rectangular grids
- Edge-bandwidth of grids and tori
- New bounds on the edge-bandwidth of triangular grids
- scientific article; zbMATH DE number 4164911 (Why is no real title available?)
- On the edge-bandwidth of graph products
- Antibandwidth of three-dimensional meshes
- Bandwidth of graphs resulting from the edge clique covering problem
- The edge-diametric theorem in Hamming spaces
This page was built for publication: Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629454)