arXiv · 1103.4901
The surjectivity of the combinatorial Laplacian on infinite graphs
Abstract
Given a connected locally finite simplicial graph $ G$ with vertex set $V$, the combinatorial Laplacian $Δ_G \colon \R^V \to \R^V$ is defined on the space of all real-valued functions on $V$. We prove that $Δ_G$ is surjective if $G$ is infinite.
Explore related subjects
Keep this discovery
Tullio Ceccherini-Silberstein, Michel Coornaert, Jozef Dodziuk. 2011-03-25. The surjectivity of the combinatorial Laplacian on infinite graphs. https://arxiv.org/abs/1103.4901
Cite the original work for its findings. Save a collection to share your selection of sources.