Separation numbers of trees

DOI10.1016/J.TCS.2009.05.011zbMath1201.05081OpenAlexW1969046479MaRDI QIDQ837168

Tao Jiang, Dan Pritikin, Zevi Miller

Publication date: 10 September 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.011

zbMATH Keywords

labelingbandwidthseparationantibandwidth

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 ⋮ Antibandwidth and Cyclic Antibandwidth of Hamming Graphs

Cites Work

• Unnamed Item
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Eigenvalues and separation in graphs
• Well-Spaced Labelings of Points in Rectangular Grids
• On Some Variants of the Bandwidth Minimization Problem
• Antibandwidth of Complete k-Ary Trees
• On the separation number of a graph

This page was built for publication: Separation numbers of trees