Some Properties of the Eigenvalues of the Net Laplacian Matrix of a Signed Graph

Abstract

Given a signed graph G, let AG and DG± denote its standard adjacency matrix and the diagonal matrix of vertex net-degrees, respectively. The net Laplacian matrix of is defined to be NG = NG±-AG. In this study we give some properties of the eigenvalues of NG. In particular, we consider their behaviour under some edge perturbations, establish some relations between them and the eigenvalues of the standard Laplacian matrix and give some lower and upper bounds for the largest eigenvalue of NG.