On explicit formulas for bandwidth and antibandwidth of hypercubes
From MaRDI portal
Publication:1026164
Recommendations
Cites work
- scientific article; zbMATH DE number 2060183 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- A dynamic survey of graph labeling
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- New results on edge-bandwidth
- On Some Variants of the Bandwidth Minimization Problem
- On the separation number of a graph
- Optimal numberings and isoperimetric problems on graphs
- The bandwidth problem for graphs and matrices—a survey
Cited in
(10)- Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
- A special antidilation problem for meshes and Hamming graphs
- A note on computational approaches for the antibandwidth problem
- Bandwidth and pathwidth of three-dimensional grids
- The maximum \(k\)-differential coloring problem
- Bandwidth of the product of paths of the same length
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- Memetic algorithm for the antibandwidth maximization problem
- A note on maximum differential coloring of planar graphs
- Antibandwidth and cyclic antibandwidth of Hamming graphs
This page was built for publication: On explicit formulas for bandwidth and antibandwidth of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026164)