I am trying to calculate the Laplacian and Adjacency matrix of a graphs for positive and negative weights. If a graph be simple with only non-negative weight it is easier. But in my graph I have some negative weights and loops.
Please give me some references and hints if available.
Thank you for your help.