The surjectivity of the combinatorial Laplacian on infinite graphs

preprint2011arXivOpen access

Abstract

Given a connected locally finite simplicial graph G G with vertex set VV, the combinatorial Laplacian ΔG ⁣:RV→RVΔ_G \colon \R^V \to \R^V is defined on the space of all real-valued functions on VV. We prove that ΔGΔ_G is surjective if GG is infinite.

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.