Unboundedness of adjacency matrices of locally finite graphs

From MaRDI portal
Publication:993435

DOI10.1007/S11005-010-0390-8zbMATH Open1234.05151arXiv0910.3466OpenAlexW3104061846MaRDI QIDQ993435FDOQ993435

Sylvain Golénia

Publication date: 20 September 2010

Published in: Letters in Mathematical Physics (Search for Journal in Brave)

Abstract: Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We also consider the case of weighted graphs. We discuss the question of self-adjoint extensions and prove an optimal criterium.


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





Cites Work


Cited In (12)






This page was built for publication: Unboundedness of adjacency matrices of locally finite graphs

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