arXiv · 1006.5778
Essential self-adjointness for combinatorial Schrödinger operators II- Metrically non complete graphs
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ödinger operators in the metrically non complete case.
Explore related subjects
Keep this discovery
Yves Colin De Verdière, Nabila Torki-Hamza, Francoise Truc. 2013-03-04. Essential self-adjointness for combinatorial Schrödinger operators II- Metrically non complete graphs. https://doi.org/10.1007/s11040-010-9086-7
Cite the original work for its findings. Save a collection to share your selection of sources.