pith. sign in

arxiv: 2605.10944 · v1 · submitted 2026-04-28 · 🧮 math.CO

Eigenvalues of boldsymbol{L_α}-matrices under graph operations

Gabriel Roberto Silva de Lima , Carla Silva Oliveira , Jo\~ao Domingos Gomes da Silva Junior This is my paper

Pith reviewed 2026-05-13 05:59 UTC · model grok-4.3

classification 🧮 math.CO MSC 05C50
keywords L_alpha matrixgraph eigenvaluesspectral graph theorygraph operationsadjacency matrixLaplacian matrixdegree matrix
0
0 comments X

The pith

L_alpha matrices let researchers track how eigenvalues change under graph operations for any alpha between zero and one.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines a one-parameter family of matrices that blends a graph's degree matrix and adjacency matrix and then examines what happens to the eigenvalues when the underlying graph is changed by standard operations such as disjoint union or join. A reader would care because the same formulas are meant to recover the spectra of the adjacency matrix, the degree matrix, and the Laplacian matrix simply by choosing different values of the parameter alpha. If the eigenvalues behave predictably under these operations for every alpha, then spectral results proved for one matrix in the family immediately give results for the others without separate proofs.

Core claim

For graphs formed by common operations from smaller graphs, the eigenvalues of L_alpha of the new graph are determined explicitly by the eigenvalues of L_alpha of the pieces, with the precise relation depending on alpha, the sizes of the graphs, and the particular operation performed.

What carries the argument

The L_alpha matrix, the convex combination alpha times the degree matrix plus (alpha minus one) times the adjacency matrix, whose eigenvalues are tracked across graph operations.

If this is right

  • When alpha equals zero the formulas reduce to the known eigenvalue rules for the adjacency matrix under the same operations.
  • When alpha equals one the formulas recover the eigenvalue rules for the degree matrix.
  • When alpha equals one half the formulas recover the eigenvalue rules for the Laplacian matrix up to a constant factor.
  • Explicit eigenvalue lists become available for infinite families of graphs built by repeated application of the operations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same approach could be tested on other operations such as the Cartesian product or the corona to see whether the unification still holds.
  • If the relations survive, they might supply new bounds on the algebraic connectivity or the largest eigenvalue that apply simultaneously to all three classical matrices.
  • Numerical checks on random graphs could reveal whether the formulas remain accurate when the graphs are only approximately built from the basic operations.

Load-bearing premise

The specific convex combination chosen for L_alpha continues to produce useful and consistent spectral relations for every alpha in the interval and every simple graph when the graph is altered by the operations studied.

What would settle it

Take two small graphs such as the path on three vertices and the complete graph on two vertices, form their disjoint union, compute the eigenvalues of L_alpha directly for a fixed alpha such as 1/2, and check whether those eigenvalues match the union of the eigenvalues computed separately on each piece; a mismatch for any alpha would refute the claimed relations.

Figures

Figures reproduced from arXiv: 2605.10944 by Carla Silva Oliveira, Gabriel Roberto Silva de Lima, Jo\~ao Domingos Gomes da Silva Junior.

Figure 1
Figure 1. Figure 1: Examples of the graph operations and the graph [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Examples of some families of graphs. 2 [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
read the original abstract

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

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 3 minor

Summary. The manuscript defines the family of matrices L_α(G) = α D(G) + (α − 1) A(G) for α ∈ [0,1] on a simple graph G and investigates the eigenvalues of L_α under standard graph operations (disjoint union, join, complement, and Cartesian product) as well as for specific families including complete graphs, paths, cycles, and complete bipartite graphs. Explicit formulas, interlacing inequalities, and bounds on the spectrum are derived in terms of the spectra of the constituent graphs or the parameter α.

Significance. If the derivations hold, the work supplies a parameterized interpolation between the adjacency spectrum (α = 0), a scaled Laplacian spectrum (α = 0.5), and the degree spectrum (α = 1). The explicit results under operations and for named families could serve as a reference for spectral graph theorists seeking unified statements across these classical matrices.

major comments (1)
  1. [§4.2, Theorem 4.3] §4.2, Theorem 4.3: the claimed eigenvalue formula for the join G ∨ H assumes that the largest eigenvalue of L_α(G) and L_α(H) are simple; the proof sketch does not address multiplicity or the case when α = 1 (where L_α reduces to D). This assumption is load-bearing for the interlacing claim that follows.
minor comments (3)
  1. [Introduction] The introduction cites Wang2020 for the definition of L_α but does not restate the precise normalization or the convention for the sign of the off-diagonal entries; adding a self-contained sentence would improve readability.
  2. Notation for the spectrum is inconsistent: sometimes λ_i(L_α) is used, sometimes σ(L_α). A single convention should be adopted throughout.
  3. [Table 1] Table 1 (eigenvalues for P_n) lists numerical values for α = 0.5 but omits the corresponding exact algebraic expressions that appear in the text; cross-referencing would help.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading, positive summary, and recommendation of minor revision. We address the single major comment below.

read point-by-point responses

  1. Referee: [§4.2, Theorem 4.3] §4.2, Theorem 4.3: the claimed eigenvalue formula for the join G ∨ H assumes that the largest eigenvalue of L_α(G) and L_α(H) are simple; the proof sketch does not address multiplicity or the case when α = 1 (where L_α reduces to D). This assumption is load-bearing for the interlacing claim that follows.

    Authors: We appreciate the referee's observation on Theorem 4.3. The current proof does invoke simplicity of the largest eigenvalues of L_α(G) and L_α(H). For α ∈ (0,1) this follows from the Perron-Frobenius theorem applied to the irreducible nonnegative matrix obtained by a suitable shift of L_α when G and H are connected. To strengthen the result we will revise the theorem statement to state the simplicity assumption explicitly, extend the proof to the multiplicity case via the variational characterization (min-max theorem), and add a separate direct computation for the degenerate case α = 1, where L_α reduces to the degree matrix D and the spectrum of the join is simply the list of degrees deg_G(v) + |H| (v ∈ V(G)) and deg_H(w) + |G| (w ∈ V(H)). The interlacing inequalities will be restated with the appropriate multiplicity handling. These clarifications will appear in the revised manuscript. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper adopts the external definition L_α(G) = αD(G) + (α-1)A(G) from the cited Wang2020 reference and then derives new eigenvalue results under graph operations and for specific graph families. No load-bearing step reduces by construction to a fitted parameter, self-definition, or a self-citation chain; the unified-framework motivation is stated as context rather than a derived claim that loops back to the paper's own inputs or outputs. The central analysis therefore remains independent of its starting definition.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the matrix definition introduced in the cited 2022 reference together with standard facts from linear algebra and graph theory. No free parameters are fitted to data. No new entities are postulated.

axioms (2)
  • domain assumption L_alpha(G) equals alpha times D(G) plus (alpha minus 1) times A(G) for alpha in the closed interval from 0 to 1
    This is the defining relation taken from the cited prior work and used throughout the investigation.
  • standard math Standard algebraic properties of symmetric real matrices and their eigenvalues hold for the resulting L_alpha
    Invoked implicitly when discussing spectra under graph operations.

pith-pipeline@v0.9.0 · 5439 in / 1397 out tokens · 78079 ms · 2026-05-13T05:59:36.012809+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    Horn and Charles R

    Roger A. Horn and Charles R. Johnson , title =. 2013 , address =

    work page 2013

  2. [2]

    Lang, Serge , title =

    work page

  3. [3]

    and Foote, Richard M

    Dummit, David S. and Foote, Richard M. , title =

    work page

  4. [4]

    Proyecciones Journal of Mathematics , volume =

    André Ebling Brondani and Francisca Andrea Macedo França and Carla Silva Oliveira , title =. Proyecciones Journal of Mathematics , volume =. 2022 , month =

    work page 2022

  5. [5]

    The generalized distance matrix , journal =

    Shu-Yu Cui and Jing-Xiang He and Gui-Xian Tian , keywords =. The generalized distance matrix , journal =. 2019 , issn =. doi:https://doi.org/10.1016/j.laa.2018.10.014 , url =

    work page doi:10.1016/j.laa.2018.10.014 2019

  6. [6]

    AIMS Mathematics , volume =

    Wafaa Fakieh and Zakeiah Alkhamisi and Hanaa Alashwali , title =. AIMS Mathematics , volume =. 2024 , doi =

    work page 2024

  7. [7]

    Spectral properties of KK_n^j graphs , journal =

    Maria Freitas and Renata Del-Vecchio and Nair Abreu , doi =. Spectral properties of KK_n^j graphs , journal =. 2010 , pages =

    work page 2010

  8. [8]

    , title =

    Hoffman, Alan J. , title =. SIAM Journal on Applied Mathematics , volume =

    work page

  9. [9]

    Nikiforov , title =

    V. Nikiforov , title =. Applicable Analysis and Discrete Mathematics , volume =. 2017 , doi =

    work page 2017

  10. [10]

    Ars Mathematica Contemporanea , volume =

    Aniruddha Samanta and Deepshikha and Kinkar Chandra Das , title =. Ars Mathematica Contemporanea , volume =. 2024 , doi =

    work page 2024

  11. [11]

    Wang and D

    S. Wang and D. Wong and F. Tian , title =. Linear Algebra and its Applications , volume =. 2020 , doi =

    work page 2020

  12. [12]

    2009 , issn =

    Some graphs determined by their spectra , journal =. 2009 , issn =

    work page 2009

  13. [13]

    More on the Relation between Energy and Laplacian Energy of Graphs , volume =

    Stanković, Ivan and Stevanović, Dragan and Milošević, Marko , year =. More on the Relation between Energy and Laplacian Energy of Graphs , volume =

    work page

  14. [14]

    Brondani and F.A.M

    A.E. Brondani and F.A.M. França and C.S. Oliveira , keywords =. Positive semidefiniteness of. Discrete Applied Mathematics , volume =. 2022 , issn =

    work page 2022

  15. [15]

    Linear Algebra and Its Applications , year =

    Ernesto Estrada and Michele Benzi , title =. Linear Algebra and Its Applications , year =

    work page

  16. [16]

    Linear Algebra and Its Applications , year =

    L.You and M.Yang and W.So and W.Xi , title =. Linear Algebra and Its Applications , year =

    work page

  17. [17]

    Broxon, B. J. , title =

    work page

  18. [18]

    Junior , title =

    Uilton Cesar P. Junior , title =

    work page

  19. [19]

    2009 , howpublished =

    Samuel Jurkiewicz , title =. 2009 , howpublished =

    work page 2009

  20. [20]

    De Abreu, N. M. M. and Del-Vecchio, R. R. and Vinagre, C. T. M. and Stevanovic, D. , title =. Introdução à Teoria Espectral de Grafos com Aplicações , editor =

    work page