Essential self-adjointness for combinatorial Schr\"odinger operators II- Metrically non complete graphs
classification
🧮 math.SP
keywords
weightedcompleteessentialgraphsmetricallyodingeroperatorsschr
read the original abstract
We consider weighted graphs, we equip them with a metric structure given by a weighted distance, and we discuss essential self-adjointness for weighted graph Laplacians and Schr\"odinger operators in the metrically non complete case.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.