We obtain bounds for the separation number of a graph in terms of simpler parameters. With the aid of these bounds, we determine the separation number for various special graphs, in particular multiples of small graphs. This leads to concepts like robustness and asymptotic separation number.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.