Antibandwidth of Three-Dimensional Meshes

DOI10.1016/j.endm.2007.01.023zbMath1291.05181OpenAlexW2028682327MaRDI QIDQ3439580

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

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.2007.01.023

zbMATH Keywords

three-dimensionalmeshantibandwidth

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Tabu search for the cyclic bandwidth problem ⋮ Memetic algorithm for the antibandwidth maximization problem ⋮ GRASP with path relinking heuristics for the antibandwidth problem

Cites Work

• Compressions and isoperimetric inequalities
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Hamiltonian powers in threshold and arborescent comparability graphs
• Matchings and paths in the cube
• A dynamic survey of graph labeling
• On Some Variants of the Bandwidth Minimization Problem
• Antibandwidth of Complete k-Ary Trees
• On the separation number of a graph
• Optimal Indexing of the Vertices of Graphs
• Powers of Hamiltonian paths in interval graphs
• Unnamed Item
• Unnamed Item

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