On the Colin de Verdiere graph number and penny graphs
Abstract
The Colin de Verdiere number of graph G, denoted by μ(G), is a spectral invariant of G that is related to some of its topological properties. For example, μ(G) ≤ 3 iff G is planar. A penny graph is the contact graph of equal-radii disks with disjoint interiors in the plane. In this note we prove lower bounds on μ(G) when the complement G is a penny graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.