A reduction procedure for the Colin de Verdière number of a graph

We find the Colin de Verdiere number μ for all complete multipartite graphs and show that for any graph G there exists a reduction process that results in a complete multipartite graph H with μ ( G ) ≤ μ ( H ) . We give examples of the upper bounds that can be obtained via this process.