Matrix tree theorem for the net Laplacian matrix of a signed graph
Matrix tree theorem for the net Laplacian matrix of a signed graph
For a simple signed graph G with the adjacency matrix A and net degree matrix DĀ±, the net Laplacian matrix is LĀ±=DĀ±āA. We introduce a new oriented incidence matrix NĀ± which can keep track of the sign as well as the orientation of each edge of G. Also LĀ±=NĀ±(NĀ±)T. Using ā¦