English

Eigenvalues of $\boldsymbol{L_\alpha}-$matrices under graph operations

Combinatorics 2026-05-13 v1

Abstract

Let GG be a simple graph, A(G)A(G) its adjacency matrix, and D(G)D(G) its diagonal degree matrix. In 2022, \citeauthor{Wang2020} (\cite{Wang2020}) defined the family of matrices LαL_\alpha as the convex linear combination: Lα(G)=αD(G)+(α1)A(G), L_\alpha(G) = \alpha D(G) + (\alpha - 1)A(G), where α[0,1]\alpha \in [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)D(G) - A(G)). In this work, we investigate the spectrum of LαL_\alpha under graph operations and within specific families of graphs.

Keywords

Cite

@article{arxiv.2605.10944,
  title  = {Eigenvalues of $\boldsymbol{L_\alpha}-$matrices under graph operations},
  author = {Gabriel Roberto Silva de Lima and Carla Silva Oliveira and João Domingos Gomes da Silva Junior},
  journal= {arXiv preprint arXiv:2605.10944},
  year   = {2026}
}

Comments

13 pages, 2 figures

R2 v1 2026-07-22T07:05:19.284Z