Info
This question is closed. Reopen it to edit or answer.
Obtaining laplacian of a graph
1 view (last 30 days)
Show older comments
The Neumann Laplacian of a simple graph(G) can be formed from the commands degree(G) and adjacency(G), L= D- A .
Could someone suggest how Dirichlet laplacian can be obtained?
5 Comments
Christine Tobler
on 19 Dec 2018
A graph doesn't have an inherent dimensionality, this would have to be based on the construction of the graph. Perhaps the linked paper has more information.
Answers (0)
See Also
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!