Info

此问题已关闭。 请重新打开它进行编辑或回答。

Obtaining laplacian of a graph

1 次查看（过去 30 天）
Deepa Maheshvare
Deepa Maheshvare 2018-12-16
关闭： MATLAB Answer Bot 2021-8-20
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 个评论
显示 3更早的评论
Deepa Maheshvare
Deepa Maheshvare 2018-12-19
I tried the above formula for an 1 D graph with 5 nodes.
d = 1,
L = 2*d*I + (2*d*I - D) - A,
gives,
3 -1 0 0 0
-1 2 -1 0 0
0 -1 2 -1 0
0 0 -1 2 -1
0 0 0 -1 3
whereas, the pseudo dirichlet 2*d*I-A (1.9)gives
2 -1 0 0 0
-1 2 -1 0 0
0 -1 2 -1 0
0 0 -1 2 -1
0 0 0 -1 2
which matches with the laplacian computed using centered difference formula for the second derivative operator with dirichlet boundary condition.
Also, I am not sure how the dimensionality of any given graph can be determined.
Any suggestions?
Christine Tobler
Christine Tobler 2018-12-19
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.

此问题已关闭。

回答（0 个）

此问题已关闭。

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by