A Graph Spectral Flow for Computing Nodal Deficiencies

arXiv2008.10684MaRDI QIDQ6347657FDOQ6347657

Authors: Wesley Hamilton 

Publication date: 24 August 2020

Abstract: In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $mathbb{R}^n$ to the graph setting. We mention some open problems relating the topology of a graph to the analytic behaviour of its Laplace eigenvectors, and include numerical examples illustrating our flow.

This page was built for publication: A Graph Spectral Flow for Computing Nodal Deficiencies

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