The Strong Arnold Property for 4-connected flat graphs
Combinatorics
2015-12-11 v1
Abstract
We show that if is a 4-connected flat graph, then any real symmetric matrix with exactly one negative eigenvalue and satisfying, for any two distinct vertices and , if and are adjacent, and if and are nonadjacent, has the Strong Arnold Property: there is no nonzero real symmetric matrix with and whenever and are equal or adjacent. (A graph is {\em flat} if it can be embedded injectively in -dimensional Euclidean space such that the image of any circuit is the boundary of some disk disjoint from the image of the remainder of the graph.) This applies to the Colin de Verdi\`ere graph parameter, and extends similar results for 2-connected outerplanar graphs and 3-connected planar graphs.
Keywords
Cite
@article{arxiv.1512.03200,
title = {The Strong Arnold Property for 4-connected flat graphs},
author = {Alexander Schrijver and Bart Sevenster},
journal= {arXiv preprint arXiv:1512.03200},
year = {2015}
}