Essential self-adjointness for combinatorial Schrödinger operators II- Metrically non complete graphs

preprint2013arXivOpen access

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 this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.