Theoretical analysis reveals the Colin de Verdière parameter in metric graphs via differential operators, indicating continuous spectral criteria for graph planarity.
The Colin de Verdière parameter is a number assigned to discrete graphs which equals the maximal multiplicity of the second eigenvalue of a certain family of Laplacian matrices related to the graph. In this paper it is shown that the Colin de Verdière parameter can be obtained in the setting of metric graphs by looking at the maximal multiplicity of the second eigenvalue for Laplacians on metric graphs with delta couplings at the vertices. Two different families of Laplacians, as well as a family of Schrödinger operators, all leading to the Colin de Verdière number are presented.
No takes yet. Share an insight, caveat, or question.
Brolin et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: