pith. sign in

arxiv: 1512.03200 · v1 · pith:SJKKQNUVnew · submitted 2015-12-10 · 🧮 math.CO

The Strong Arnold Property for 4-connected flat graphs

classification 🧮 math.CO
keywords connectedgraphflatgraphsadjacentarnoldimagematrix
0
0 comments X
read the original abstract

We show that if $G=(V,E)$ is a 4-connected flat graph, then any real symmetric $V\times V$ matrix $M$ with exactly one negative eigenvalue and satisfying, for any two distinct vertices $i$ and $j$, $M_{ij}<0$ if $i$ and $j$ are adjacent, and $M_{ij}=0$ if $i$ and $j$ are nonadjacent, has the Strong Arnold Property: there is no nonzero real symmetric $V\times V$ matrix $X$ with $MX=0$ and $X_{ij}=0$ whenever $i$ and $j$ are equal or adjacent. (A graph $G$ is {\em flat} if it can be embedded injectively in $3$-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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.