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 not deleted
user 90343
The Laplacian matrix is the representation of a graph in matrix form.
4
votes
2
answers
1k
views
What's the full assumption for Laplacian matrix $L=BB^T=\Delta-A$?
Problem
When Laplacian matrix $L=BB^T=\Delta-A$? Many definitions I saw do not give clear assumption in the context. Say, undirected or directed, oriented or unoriented, $A_{in}$ or $A_{out}$ or $A$? … The relation between adjacency and incidence matrix is given by the admittance
matrix or Laplacian $Q=BB^T=\Delta-A$
EDIT2
1. adjacency matrix
unweighted, nomultiple-edges $A$, $N\times N$, noselfloop …
- 211
1
vote
What's the full assumption for Laplacian matrix $L=BB^T=\Delta-A$?
The matrix $L=\tilde{D}\tilde{D}^\intercal =D−A$ is called the (unnormalized) graph Laplacian of the graph $G$. …
- 211