On the separation number of a graph

DOI10.1002/NET.3230190604MaRDI QIDQ3833885zbMATH OpenOpenAlexFDO

Authors Z. Miller, Dan Pritikin

Publication date 1989

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230190604

zbMATH Keywords

asymptotically optimal lower boundsbandwidth minimizationbipartite graphsforestsgraph labelinggridshypercubesseparation number

Mathematics Subject Classification ID

Graph theory (05C99) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 638688
• On the path separation number of graphs
• Separation numbers of trees
• scientific article; zbMATH DE number 861319
• On -labelings of complete bipartite graphs.

Cites work

• Graph theory with applications

Cited in

(27)

• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• On explicit formulas for bandwidth and antibandwidth of hypercubes
• Antibandwidth of complete \(k\)-ary trees
• The vertex separation number of a graph equals its path-width
• Eigenvalues and separation in graphs
• How many steps are necessary to separate a bigraph?
• Scheduling dyadic intervals
• A note on computational approaches for the antibandwidth problem
• A general variable neighborhood search for the cyclic antibandwidth problem
• On the number of edges of separated multigraphs
• The maximum \(k\)-differential coloring problem
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• scientific article; zbMATH DE number 3854443 (Why is no real title available?)
• Tabu search for the cyclic bandwidth problem
• The Cyclic Antibandwidth Problem
• Antibandwidth of Complete k-Ary Trees
• Antibandwidth of Three-Dimensional Meshes
• Graphs of separability at most 2
• scientific article; zbMATH DE number 638688 (Why is no real title available?)
• A special antidilation problem for meshes and Hamming graphs
• A note on maximum differential coloring of planar graphs
• scientific article; zbMATH DE number 861319 (Why is no real title available?)
• Level-based heuristics and hill climbing for the antibandwidth maximization problem
• Memetic algorithm for the antibandwidth maximization problem
• Separation numbers of trees
• Antibandwidth of three-dimensional meshes

This page was built for publication: On the separation number of a graph

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