The Cyclic Antibandwidth Problem

DOI10.1016/J.ENDM.2005.06.030zbMATH Open1200.05121OpenAlexW2085438013MaRDI QIDQ3439338FDOQ3439338

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

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

zbMATH Keywords

torushypercubecyclic bandwidth problemmeshcyclic antibandwidth

Mathematics Subject Classification ID

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

Cites Work

• A dynamic survey of graph labeling
• On Some Variants of the Bandwidth Minimization Problem
• On the separation number of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• On embeddings in cycles

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
• Title not available (Why is that?)
• 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)