A signed graph is a graph with a sign attached to each edge. This article extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the largest Laplacian eigenvalue of a signed graph is investigated, which generalizes the corresponding results on the largest Laplacian eigenvalue of a graph.
No takes yet. Share an insight, caveat, or question.
Hou et al. (2003) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: