Complex Graph LaplacianSource:
The Laplacian of a signed graph containing ambivalent ties.
edge attribute name that encodes positive ("P"), negative ("N") and ambivalent ("A") ties.
Whether to calculate the normalized Laplacian. See definitions below.
See laplacian_matrix of igraph for more details. In the complex case, D is a diagonal matrix containing the absolute values of row sums of the complex adjacency matrix.