Antibandwidth of complete k-ary trees

DOI10.1016/J.DISC.2008.10.019MaRDI QIDQ1045176zbMATH OpenOpenAlexFDO

Authors Tiziana Calamoneri, A. Massini, L'ubomír Török, Imrich Vrt'o

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)

Recommendations

• Antibandwidth of Complete k-Ary Trees
• Some results on the antibandwidth of \(k\)-ary complete trees of height 3 for odd \(k\)
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• scientific article; zbMATH DE number 1156603
• Antibandwidth of three-dimensional meshes

Cites work

• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Hamiltonian powers in threshold and arborescent comparability graphs
• scientific article; zbMATH DE number 2016615 (Why is no real title available?)
• On Some Variants of the Bandwidth Minimization Problem
• On the separation number of a graph
• Powers of Hamiltonian paths in interval graphs

Cited in

(6)

• A note on computational approaches for the antibandwidth problem
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Antibandwidth of Complete k-Ary Trees
• A special antidilation problem for meshes and Hamming graphs
• Some results on the antibandwidth of \(k\)-ary complete trees of height 3 for odd \(k\)
• A double-stage heuristic algorithm for the antibandwidth maximization problem via the linear bottleneck assignment optimization

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

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