Unifying adjacency, Laplacian, and signless Laplacian theories
Aniruddha Samanta, Deepshikha, Kinkar Chandra Das

TL;DR
This paper introduces a unified matrix $B_\alpha(G)$ that interpolates between adjacency, Laplacian, and signless Laplacian matrices, and explores its spectral properties to unify and extend graph spectral theories.
Contribution
It defines the $B_\alpha$-matrix as a new unified framework for spectral graph theory, connecting various classical matrices and deriving new bounds and properties.
Findings
Eigenvalues of $B_\alpha(G)$ vary continuously with $\alpha$
Characterization of positive semidefinite $B_\alpha$-matrices
Bounds for eigenvalues, independence number, and chromatic number
Abstract
Let be a simple graph with associated diagonal matrix of vertex degrees , adjacency matrix , Laplacian matrix and signless Laplacian matrix . Recently, Nikiforov proposed the family of matrices defined for any real as , and also mentioned that the matrices can underpin a unified theory of and . Inspired from the above definition, we introduce the -matrix of , for . Note that . In this article, we study several spectral properties of -matrices to unify the theories of adjacency, Laplacian, and signless Laplacian matrices of graphs. In particular, we prove that each eigenvalue of is…
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
TopicsTopological and Geometric Data Analysis · Spectral Theory in Mathematical Physics
