On explicit formulas for bandwidth and antibandwidth of hypercubes
From MaRDI portal
Publication:1026164
DOI10.1016/J.DAM.2008.12.004zbMATH Open1211.05156OpenAlexW1971217502MaRDI QIDQ1026164FDOQ1026164
Xiaohan Wang, Xiaolin Wu, Sorina Dumitrescu
Publication date: 24 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.12.004
Recommendations
Cites Work
- A dynamic survey of graph labeling
- Title not available (Why is that?)
- Optimal numberings and isoperimetric problems on graphs
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Title not available (Why is that?)
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- On Some Variants of the Bandwidth Minimization Problem
- On the separation number of a graph
- The bandwidth problem for graphs and matrices—a survey
- New results on edge-bandwidth
Cited In (10)
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- Bandwidth and pathwidth of three-dimensional grids
- Bandwidth of the product of paths of the same length
- A special antidilation problem for meshes and Hamming graphs
- A note on maximum differential coloring of planar graphs
- The maximum \(k\)-differential coloring problem
- A note on computational approaches for the antibandwidth problem
- Memetic algorithm for the antibandwidth maximization problem
- Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
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)
