Generating the laplacian for a sub-graph that still reflects the connectivity of the overall graph
2 次查看(过去 30 天)
显示 更早的评论
Generating a sub-graph I think by convention breaks all edges between the sub-graph and the rest of the graph. Is it possible to include the edges with the rest of the graph in the resulting laplacian? In other words, the sub-graph will still consist of the subset of nodes that you want. How do you do this?
2 个评论
Steven Lord
2022-11-1
So you somehow want to represent edges in the subgraph that go to nodes that are not present in the subgraph?
Can you show a small concrete example of a graph and its subgraph and the graph Laplacian for the subgraph that you're hoping to generate?
采纳的回答
Steven Lord
2022-11-1
Your comment refers to "the first figure" but no figures are attached to this post nor are there any linked documents including figures. But what I think you want to do is just to take a submatrix portion of the Laplacian of the whole graph.
rng default
A = sprand(10, 10, 0.2);
A = (A+A')/2;
G = graph(A, string(1:10), 'omitselfloops');
plot(G)
So if we took the subgraph that consists of nodes 1, 2, 8, 9, and 10:
nodes = [1 2 8 9 10];
S = subgraph(G, nodes);
figure
plot(S)
Would you want what's in the variable named expected below instead of the variable Lsub? [Note I've intentionally converted the Laplacians to full from sparse to make them a little easier to read.] If not then for this particular pair of graphs G and S, what would you expect to receive?
Lfull = full(laplacian(G))
Lsub = full(laplacian(S))
expected = Lfull(nodes, nodes)
0 个评论
更多回答(0 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!