On explicit formulas for bandwidth and antibandwidth of hypercubes

DOI10.1016/j.dam.2008.12.004zbMath1211.05156OpenAlexW1971217502MaRDI QIDQ1026164

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

zbMATH Keywords

hypercubebandwidthantibandwidth

Mathematics Subject Classification ID

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

Related Items (9)

The maximum \(k\)-differential coloring problem ⋮ Memetic algorithm for the antibandwidth maximization problem ⋮ A special antidilation problem for meshes and Hamming graphs ⋮ Antibandwidth and cyclic antibandwidth of Hamming graphs ⋮ Bandwidth of the product of paths of the same length ⋮ A note on maximum differential coloring of planar graphs ⋮ Bandwidth and pathwidth of three-dimensional grids ⋮ A note on computational approaches for the antibandwidth problem ⋮ Antibandwidth and Cyclic Antibandwidth of Hamming Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• A dynamic survey of graph labeling
• New results on edge-bandwidth
• On Some Variants of the Bandwidth Minimization Problem
• On the separation number of a graph
• The bandwidth problem for graphs and matrices—a survey
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: On explicit formulas for bandwidth and antibandwidth of hypercubes