Isospectral graphs with identical nodal counts

DOI10.1088/1751-8113/45/13/135203zbMath1237.05128arXiv1110.0158OpenAlexW2062929681MaRDI QIDQ5390039

Idan Oren, Ram Band

Publication date: 27 April 2012

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.0158

zbMATH Keywords

quantum graphsgeneralized Laplacians on discrete graphsisospectral discrete graphsnodal count sequences

Mathematics Subject Classification ID

Spectral problems; spectral geometry; scattering theory on manifolds (58J50) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems involving ordinary differential equations (34A55) Isospectrality (58J53) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Related Items (6)

Line graphs and the transplantation method ⋮ Isospectral discrete and quantum graphs with the same flip counts and nodal counts ⋮ The nodal count {0,1,2,3,…} implies the graph is a tree ⋮ Hearing shapes viap-adic Laplacians ⋮ A geometric construction of isospectral magnetic graphs ⋮ Neumann domains on quantum graphs

This page was built for publication: Isospectral graphs with identical nodal counts