Eigenvalues of Lα-matrices under graph operations
Abstract
Let G be a simple graph, A(G) its adjacency matrix, and D(G) its diagonal degree matrix. In 2022, Wang2020 (Wang2020) defined the family of matrices Lα as the convex linear combination: \[ Lα(G) = α D(G) + (α - 1)A(G), \] where α ∈ [0,1]. The study of the spectrum of this family of matrices may provide a unified framework for analyzing the spectra of the adjacency, degree, and Laplacian matrices (D(G) - A(G)). In this work, we investigate the spectrum of Lα under graph operations and within specific families of graphs.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.