Nodal domain theorem of signed hypergraphs
From MaRDI portal
Abstract: In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians. In 2019, Jost and Mulas generalized the normalized combinatorial Laplace operator of graphs to signed hypergraphs. In this paper, we establish nodal domain theorems for the normalized combinatorial Laplace operator in signed hypergraphs. We also obtain a lower bound estimates for the number of strong nodal domains.
This page was built for publication: Nodal domain theorem of signed hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404163)
