Interlacing Properties of Eigenvalues of Laplacian and Net-Laplacian Matrix of Signed Graphs
Abstract
This paper explores interlacing inequalities in the Laplacian spectrum of signed cycles and investigates interlacing relationship between the spectrum of the net-Laplacian of a signed graph and its subgraph formed by removing a vertex together with its incident edges. Additionally, an inequality is derived between the net-Laplacian spectrum of a complete co-regular signed graph and the Laplacian spectrum of the graph obtained by removing any vertex v from . Also for a signed graph , the net-Laplacian matrix is normalized and an inequality is derived between the spectrum of the normalized net-Laplacian of a signed graph and its subgraph, formed by contraction of edge and vertex.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.