On the Colin de Verdiere graph number and penny graphs

preprint2020arXivOpen access

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) \leq 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 \bar{G} is a penny graph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.