arXiv · 1412.5854
A short remark on the surjectivity of the combinatorial Laplacian on infinite graphs
Abstract
Applying a well-known theorem due to Eidelheit, we give a short proof of the surjectivity of the combinatorial Laplacian on connected locally finite undirected simplicial graph $G$ with countably infinite vertex set $V$, established by Ceccherini-Silberstein, Coornaert, and Dodziuk. In fact, we show that every linear operator on $\mathbb{K}^V$ which has finite hopping range and satisfies the pointwise maximum principle is surjective.
Explore related subjects
Keep this discovery
Thomas Kalmes. 2014-12-18. A short remark on the surjectivity of the combinatorial Laplacian on infinite graphs. https://doi.org/10.1007/s13398-015-0258-y
Cite the original work for its findings. Save a collection to share your selection of sources.