On the sign patterns of the smallest signless Laplacian eigenvector
Felix Goldberg, Steve Kirkland

TL;DR
This paper investigates the stability of the sign pattern of the smallest eigenvector of the signless Laplacian in bipartite graphs when edges are added within the bipartition sets.
Contribution
It characterizes conditions under which the sign pattern of the eigenvector remains unchanged despite modifications to the graph.
Findings
Sign pattern persists under certain edge additions within bipartition sets.
Conditions identified for the stability of the eigenvector's sign pattern.
Provides cases where the sign pattern of the eigenvector is resilient to graph modifications.
Abstract
Let be a connected bipartite graph, whose signless Laplacian matrix is . Suppose that the bipartition of is and that is the eigenvector of the smallest eigenvalue of . It is well-known that is positive and constant on , and negative and constant on . The resilience of the sign pattern of under addition of edges into the subgraph induced by either or is investigated and a number of cases in which the sign pattern of persists are described.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Spectral Theory in Mathematical Physics
