Antibandwidth of complete \(k\)-ary trees

DOI10.1016/j.disc.2008.10.019zbMath1208.05126OpenAlexW2174253040MaRDI QIDQ1045176

L'ubomír Török, Imrich Vrt'o, Annalisa Massini, Tiziana Calamoneri

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.10.019

zbMATH Keywords

antibandwidthcomplete \(k\)-ary tree

Mathematics Subject Classification ID

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

Related Items (3)

A special antidilation problem for meshes and Hamming graphs ⋮ Antibandwidth and cyclic antibandwidth of Hamming graphs ⋮ A note on computational approaches for the antibandwidth problem

Cites Work

• Unnamed Item
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Hamiltonian powers in threshold and arborescent comparability graphs
• On Some Variants of the Bandwidth Minimization Problem
• On the separation number of a graph
• Powers of Hamiltonian paths in interval graphs

This page was built for publication: Antibandwidth of complete \(k\)-ary trees