The surjectivity of the combinatorial Laplacian on infinite graphs (Q353414)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6187659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The surjectivity of the combinatorial Laplacian on infinite graphs |
scientific article; zbMATH DE number 6187659 |
Statements
The surjectivity of the combinatorial Laplacian on infinite graphs (English)
0 references
12 July 2013
0 references
Summary: Given a connected locally finite simplicial graph \(G\) with vertex set \(V\), the combinatorial Laplacian \(\Delta_G\:\mathbb{R}^V\to\mathbb{R}^V\) is defined on the space of all real-valued functions on \(V\). We prove that \(\Delta_G\) is surjective if \(G\) is infinite.
0 references
connected locally finite simplicial graph
0 references
combinatorial Laplacian
0 references
0.9353113770484924
0 references
0.9247319102287292
0 references
0.7266696691513062
0 references
0.7240639328956604
0 references
