paper

The Colin de Verdière Graph Parameter for Threshold Graphs

arXiv:math/0612720

Abstract

We consider Schrödinger operators on threshold graphs and prove a formula for the Colin de Verdière parameter in terms of the building sequence. We construct an optimal Colin de Verdière matrix for each connected threshold graph of vertices. For a large subclass of threshold graphs we construct an alternative Colin de Verdière matrix depending on a large parameter. As a corollary to this last construction, we give estimates on the size of the non-zero eigenvalues of this matrix.

arXiv comment19 pages, 1 figure. Added sharp result with F. Goldberg