Hearing Euler characteristic of graphs

DOI10.1103/PHYSREVE.101.052320MaRDI QIDQ6345529zbMATH OpenWikidataFDO

Authors Michał Ławniczak, Pavel Kurasov, Szymon Bauch, Małgorzata Białous, Vitalii Yunko, Leszek Sirko

Publication date 21 July 2020

Full work available at URL https://doi.org/10.1103/PHYSREVE.101.052320

Abstract: The Euler characteristic $chi=|V|-|E|$ and the total length $mathcalL$ are the most important topological and geometrical characteristics of a metric graph. Here, $|V|$ and $|E|$ denote the number of vertices and edges of a graph. The Euler characteristic determines the number $$ of independent cycles in a graph while the total length determines the asymptotic behavior of the energy eigenvalues via the Weyl's law. We show theoretically and confirm experimentally that the Euler characteristic can be determined (heard) from a finite sequence of the lowest eigenenergies $lambd{a}_1,ldots,lambd{a}_N$ of a simple quantum graph, without any need to inspect the system visually. In the experiment quantum graphs are simulated by microwave networks. We demonstrate that the sequence of the lowest resonances of microwave networks with $$ can be directly used in determining whether a network is planar, i.e., can be embedded in the plane. Moreover, we show that the measured Euler characteristic $chi$ can be used as a sensitive revealer of the fully connected graphs.

This page was built for publication: Hearing Euler characteristic of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345529)