Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with laplacian
Search options answers only
not deleted
user 45250
The Laplacian matrix is the representation of a graph in matrix form.
2
votes
How to understand the combinatorial Laplacian $\Delta$ which is defined on the graph?
Fix a vertex $v$. Then
$$
\nabla F(uv) = c(u,v)\big(F(v)-F(u)\big)
$$
for $u$ adjacent to $v$. Now
\begin{align*}
\nabla\cdot\nabla F(v) &= \sum_{uv} c(v,u)\big(F(u)-F(v)\big)\\ &= -F(v)\left(\sum_u c …
- 3,065
12
votes
Line graphs called "graph derivatives": any intuition?
If one considers a graph $G=(V,E)$ and a function $f:V\to\mathbb{R}$, it makes sense to look at the finite differences $f(v_i)-f(v_j)$ for neighboring vertices $v_i,v_j\in V$ as a sort of discrete der …
- 3,065