All Questions
4 questions
2
votes
0
answers
515
views
Normalized Laplacian matrix versus walk Laplacian matrix (or normalized adjacency matrix versus walk adjacency matrix)
In graphs, found that two different normalization matrices exist for Laplacian and adiacency matrix. I will ask about the adjacency matrix (for the Laplacian matrix the questions are the same). The ...
- 121
4
votes
2
answers
1k
views
What's the full assumption for Laplacian matrix $L=BB^T=\Delta-A$?
Graph with no-selfloop, no-multi-edges, unweighted.
directed
For directed graph Adjacency matrix is a non-symmetric matrix $A_{in}$ considering indegree or $A_{out}$ considering outdegree. Degree ...
- 211
5
votes
1
answer
382
views
Is it possible to compute a valid Laplacian matrix from an effective resistance matrix?
I am wondering whether it is possible to retrieve a node-admittance matrix $G$ (also called Laplacian matrix) in a purely resistive network composed of nets $\{1, \dots, i, \dots, j, \dots, n\}$, from ...
1
vote
1
answer
647
views
If the two smallest eigenvalues of the Laplacian matrix of a network are equal to zero, then does it mean that the network is not connected? [closed]
What does it mean if the two smallest eigenvalues of the Laplacian matrix of a graph are equal to zero?
- 13