Antibandwidth of d-Dimensional Meshes

DOI10.1007/978-3-642-10217-2_46zbMath1267.05234OpenAlexW1480599044MaRDI QIDQ3651573

Imrich Vrt'o, L'ubomír Török

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_46

zbMATH Keywords

antibandwidth problemminimal difference of labels of adjacent vertices

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

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

This page was built for publication: Antibandwidth of d-Dimensional Meshes