The Cyclic Antibandwidth Problem

DOI10.1016/J.ENDM.2005.06.030MaRDI QIDQ3439338zbMATH OpenOpenAlexFDO

Authors Ondrej Sýkora, L'ubomír Török, Imrich Vrt'o

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.030

zbMATH Keywords

torushypercubecyclic bandwidth problemmeshcyclic antibandwidth

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38)

Recommendations

• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• scientific article; zbMATH DE number 719423
• Antibandwidth of Complete k-Ary Trees
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Antibandwidth and cyclic antibandwidth of Hamming graphs

Cites work

• scientific article; zbMATH DE number 1045605 (Why is no real title available?)
• scientific article; zbMATH DE number 2016615 (Why is no real title available?)
• A dynamic survey of graph labeling
• On Some Variants of the Bandwidth Minimization Problem
• On embeddings in cycles
• On the separation number of a graph

Cited in

(6)

• A general variable neighborhood search for the cyclic antibandwidth problem
• Cyclic bandwidth with an edge added
• A study on cyclic bandwidth sum
• scientific article; zbMATH DE number 719423 (Why is no real title available?)
• Tabu search for the cyclic bandwidth problem
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes

This page was built for publication: The Cyclic Antibandwidth Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439338)