The Laplacian of a signed graph containing ambivalent ties.

## Arguments

- g
igraph object.

- attr
edge attribute name that encodes positive ("P"), negative ("N") and ambivalent ("A") ties.

- norm
Whether to calculate the normalized Laplacian. See definitions below.

## Details

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.