On the null space of a Colin de Verdière matrix
Let graph \(G\) have vertex set \(\{1,2,\dots,n\}\), and let \({\mathcal M}(G)\) be the set of symmetric \(n\times n\) matrices \(M= (m_{i,j})\) such that: (i) \(M\) has exactly one negative eigenvalue, of multiplicity 1; (ii) for all \(i\), \(j\) with \(i\neq j\), one has: (a) \(m_{i,j}= 0\), if \(i\) and \(j\) are nonadjacent; (b) \(m_{i,j}< 0\), if \(i\) and \(j\) are adjacent. The main result of this paper is that if \(G\) is 3-connected and planar, then for any matrix \(M\in{\mathcal M}(G)\) of corank 3, the null space \(\ker M\) of \(M\) gives an imbedding of \(G\) in the 2-sphere. The authors also show that: (1) if \(G\) is a path, then for any matrix \(M\in{\mathcal M}(G)\) of corank 1, the null space \(\ker M\) of \(M\) gives an imbedding of \(G\) in the line; (2) if \(G\) is 2-connected and outerplanar, then for any matrix \(M\in{\mathcal M}(G)\) of corank 2, the null space \(\ker M\) of \(M\) gives a representation of \(G\) as a convex polygon with non-crossing diagonals. These three results are related to a parameter introduced by \textit{Y. Colin de Verdière} [J. Comb. Theory, Ser. B 50, No. 1, 11-21 (1990; Zbl 0742.05061)].
- Nullspace embeddings for outerplanar graphs
- scientific article; zbMATH DE number 475583
- On the strong Arnol'd hypothesis and the connectivity of graphs
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- The strong Arnold property for 4-connected flat graphs
- Three-connected graphs whose maximum nullity is at most three
- Null space structure of tree-patterned matrices
- The inertia set of the join of graphs
- On the null space structure associated with trees and cycles
- scientific article; zbMATH DE number 1031382
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- A short proof of the planarity characterization of Colin de Verdière
- On the invariance of Colin de Verdière's graph parameter under clique sums
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Steinitz representations of polyhedra and the Colin de Verdière number
- The strong spectral property for graphs
- Universal completability, least eigenvalue frameworks, and vector colorings
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- On the strong Arnol'd hypothesis and the connectivity of graphs
- On Vertex Partitions and the Colin de Verdière Parameter
- Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups
- Optimizing Colin de Verdière matrices of \(K_{4,4}\)
- Linkless and flat embeddings in 3-space
- scientific article; zbMATH DE number 1031382 (Why is no real title available?)
- Nullspace embeddings for outerplanar graphs
- The strong Arnold property for 4-connected flat graphs
- scientific article; zbMATH DE number 6746661 (Why is no real title available?)
- The Colin de Verdière number and graphs of polytopes
- Eigenpolytope Universality and Graphical Designs
- The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces
- On minimizing the energy of a spherical graph representation
- Even maps, the Colin de Verdière number and representations of graphs
- Some recent progress and applications in graph minor theory
This page was built for publication: On the null space of a Colin de Verdière matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296155)