Separation numbers of trees

DOI10.1016/J.TCS.2009.05.011MaRDI QIDQ837168zbMATH OpenOpenAlexFDO

Authors Tao Jiang, Z. Miller, Dan Pritikin

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)

Recommendations

• On the separation number of a graph
• scientific article; zbMATH DE number 638688
• Separation dimension of bounded degree graphs
• scientific article; zbMATH DE number 3854443
• scientific article; zbMATH DE number 861319

Cites work

• scientific article; zbMATH DE number 861319 (Why is no real title available?)
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Antibandwidth of Complete k-Ary Trees
• Eigenvalues and separation in graphs
• On Some Variants of the Bandwidth Minimization Problem
• On the separation number of a graph
• Well-spaced labelings of points in rectangular grids

Cited in

(4)

• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• A special antidilation problem for meshes and Hamming graphs
• On the separation number of a graph

This page was built for publication: Separation numbers of trees

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