arxiv: 2605.03478 · v1 · submitted 2026-05-05 · 🧮 math.CO

Recognition: unknown

Helmholzian spectra of graphs: basic properties

Lu Lu , Yongtang Shi , Zoran Stani\'c , Jianfeng Wang , Yi Wang

Authors on Pith no claims yet

Pith reviewed 2026-05-07 15:51 UTC · model grok-4.3

classification 🧮 math.CO

keywords Helmholtzian matrixLaplacian spectrumgraph spectrapositive semi-definiteoriented graphssigned graphseigenvalue interlacing

0 comments

The pith

The non-zero eigenvalues of the Laplacian matrix equal the eigenvalues of the Helmholtzian matrix for every graph.

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

The paper defines the Helmholtzian matrix as an edge-indexed graph analogue of the vector Laplacian and examines its basic spectral properties. It establishes that this matrix is always positive semi-definite, that its eigenvalues remain unchanged under any choice of edge orientation, and that they interlace when an edge is added to the graph. The central result states that the non-zero eigenvalues of the ordinary Laplacian of G are precisely the eigenvalues of the Helmholtzian matrix of G. This identity supplies a direct bridge between the adjacency and Laplacian spectra of oriented, signed, and weighted graphs.

Core claim

The Helmholtzian matrix of a graph G is positive semi-definite. Its eigenvalues are independent of the chosen orientation on the edge set, and the non-zero eigenvalues of the Laplacian matrix of G coincide exactly with the eigenvalues of the Helmholtzian matrix of G. The non-negativity of the spectrum is governed by the presence or absence of odd cycles together with the orientation, while irreducibility relates to the existence of loops in the corresponding signed graph.

What carries the argument

The Helmholtzian matrix, the first graph matrix indexed by the edge set and defined as the discrete analogue of the vector Laplacian.

If this is right

The spectrum of the Helmholtzian matrix supplies a single object that unifies the adjacency and Laplacian spectra across oriented, signed, and weighted graphs.
Eigenvalue interlacing holds when an edge is added, giving a monotonicity relation for the new matrix.
Non-negativity of the Helmholtzian spectrum is controlled by the parity of cycles and the chosen orientation.
The matrix provides a new tool for studying simplicial networks through its edge-based indexing.

Where Pith is reading between the lines

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

The identity may allow Laplacian eigenvalues to be recovered from linear algebra performed solely on the edge space rather than the vertex space.
Because the construction originates from a discretization of the vector Laplacian, the same matrix could be used to approximate differential operators on discrete manifolds or simplicial complexes.
The orientation independence suggests that signed-graph spectra can be read off directly from an unsigned construction, potentially simplifying computations in signed network analysis.

Load-bearing premise

The discretization that produces the Helmholtzian matrix from the vector Laplacian is faithful for any finite undirected graph, possibly oriented or signed, without extra conditions that would alter the claimed eigenvalue identities.

What would settle it

For the triangle graph, compute the Laplacian eigenvalues (0, 3, 3) and the Helmholtzian eigenvalues; if the claim holds, the Helmholtzian spectrum must contain exactly 3 and 3 together with one or more zeros.

Figures

Figures reproduced from arXiv: 2605.03478 by Jianfeng Wang, Lu Lu, Yi Wang, Yongtang Shi, Zoran Stani\'c.

**Figure 1.** Figure 1: The matrices B(G) and C(G) of the presented graph G. In contrast to many other matrices associated with graphs, it is indexed by the edge set. By a convention, an edgeless graph is represented by the 0 × 0 matrix. Throughout the entire paper, unless told otherwise, we assume that a graph under consideration has at least one edge! Example 1.2. We return, once again, to the graph G illustrated in view at source ↗

**Figure 2.** Figure 2: The signed graphs ΛR(G1) and ΛR(G2) obtained from G1 and G2 sharing the same underlying graph. Example 3.7. The friendship graph is the graph K1∨nK2, i.e., it is the cone over n disjoint edges. Now, ΛR(K1 ∨nK2) switches to its underlying graph for any edge orientation on K1 ∨nK2, by Proposition 3.3. Therefore, we may assume that the edges of ΛR(K1 ∨ nK2) are positive. In this case, ΛR(K1 ∨ nK2) consists of… view at source ↗

read the original abstract

The Helmholtzian matrix of a graph $G=(V(G),E(G))$ is a graph-theoretic analogue of the vector Laplacian (or Helmholtz operator) [S. Li, L. Lu, J.F. Wang, A graph discretization of vector Laplacian, 379 (2026) 446--460]. Motivated by the applications of graph Helmholtzian in simplicial networks, we will investiagte its basic spectral properties. As the first graph matrix indexed by edge set, we find that Helmholtzian matrix is positive semi-definite and its non-negativity correlates with the odd cycles in $G$ and the orientation on $E(G)$, while its irreducibility relates to the signed graphs with loops. We show that the eigenvalues of Helmholtzian matrix are independent of the orientation and further investigate the eigenvalue interlacing under edge additions. One of striking findings is that the non-zero eigenvalues of the Laplacian matrix are those of Helmholtzian matrix of every graph. All these discoveries reveal that the Helmholtzian spectrum of $G$ balances and bridges the oriented graphs, weighted graphs and signed graphs as well as their adjacency or Laplacian spectra.

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.

Desk Editor's Note private letter to a colleague

The Helmholtzian matrix matches the Laplacian spectrum by standard linear algebra, but the paper usefully explores its properties across graph variants.

read the letter

The key takeaway is that this paper defines the Helmholtzian matrix indexed by edges and shows that its non-zero eigenvalues are identical to those of the standard Laplacian for every graph. This identity holds by the usual properties of the incidence matrix, and the paper adds details on orientation independence and positive semi-definiteness. They handle the additional properties well, including how non-negativity ties to odd cycles and orientation, irreducibility for signed graphs with loops, and eigenvalue interlacing when edges are added. These explorations connect the Helmholtzian spectrum to oriented, signed, and weighted graphs, which could be practical for simplicial network models. The main limitation is that the core spectral match is a direct consequence of linear algebra rather than a deep new insight, so the novelty sits more in the systematic study of this particular matrix and its graph-theoretic interpretations. The abstract claims are clean, but without seeing the proofs I can't rule out minor gaps in the irreducibility or interlacing arguments. Overall the claims seem consistent and free of contradictions. This work is aimed at spectral graph theorists interested in matrix analogues and their applications beyond standard adjacency or Laplacian spectra. Someone working on network theory or higher-dimensional complexes would get the most value. It has enough formal grounding and clear claims to warrant a serious referee. I would recommend putting it through peer review; the topic is relevant and the results are checkable, even if revisions might be needed to sharpen the novelty discussion.

Referee Report

2 major / 3 minor

Summary. The manuscript defines the Helmholtzian matrix of a finite graph G as a graph-theoretic analogue of the vector Laplacian via a cited discretization and investigates its basic spectral properties. It claims that the matrix is positive semi-definite, that its non-negativity correlates with odd cycles and edge orientation, that it is irreducible for signed graphs with loops, that its eigenvalues are independent of orientation, that eigenvalues interlace under edge addition, and—most strikingly—that the non-zero eigenvalues of the Helmholtzian matrix coincide with the non-zero eigenvalues of the standard graph Laplacian for every graph. The work positions the Helmholtzian spectrum as bridging oriented, signed, weighted graphs and their adjacency/Laplacian spectra.

Significance. If the central claims hold, the paper provides a clean bridge between the Helmholtzian construction and classical spectral graph theory by leveraging the incidence matrix. The explicit identification of non-zero spectra with the Laplacian eigenvalues is a useful observation that follows directly from standard linear algebra on B^T B and BB^T (where B is the incidence matrix), and the orientation-independence via sign conjugation is a standard but well-applied fact here. These connections may prove useful for applications in simplicial networks and signed graphs, though the overall novelty is incremental rather than transformative.

major comments (2)

[Abstract] Abstract: The statement that the Helmholtzian matrix 'is positive semi-definite and its non-negativity correlates with the odd cycles in G and the orientation on E(G)' is unclear and risks contradiction with the construction. The matrix is a signed/oriented form of the edge Laplacian B^T B and is therefore always positive semi-definite for any finite undirected graph, independent of cycles or orientation choice. If 'non-negativity' refers to a different property (e.g., entrywise signs in the signed-graph case or a restricted subclass), this must be clarified explicitly in the main text, as it is load-bearing for the claimed basic properties.
[§2 (or equivalent definition section)] The manuscript relies entirely on the external definition from the cited 2026 discretization paper without reproducing the explicit matrix formula or incidence-matrix expression for the Helmholtzian in the present text. This makes the proofs of the eigenvalue coincidence, PSD property, and interlacing non-self-contained; the central claim equating non-zero Laplacian and Helmholtzian spectra would be strengthened by including the definition (presumably B^T D B or equivalent) and the short linear-algebra argument in §2 or §3.

minor comments (3)

[Abstract] Typo in abstract: 'investiagte' should be 'investigate'.
[Title and Abstract] Inconsistent spelling: title uses 'Helmholzian' (missing 't'), while abstract and body use 'Helmholtzian'. Standardize to 'Helmholtzian' throughout, as the term refers to the Helmholtz operator.
[Abstract] The abstract is somewhat vague on the precise statements and proof strategies; a one-sentence outline of the incidence-matrix argument for the Laplacian coincidence would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive suggestions. We address each major comment below and indicate the planned revisions.

read point-by-point responses

Referee: [Abstract] Abstract: The statement that the Helmholtzian matrix 'is positive semi-definite and its non-negativity correlates with the odd cycles in G and the orientation on E(G)' is unclear and risks contradiction with the construction. The matrix is a signed/oriented form of the edge Laplacian B^T B and is therefore always positive semi-definite for any finite undirected graph, independent of cycles or orientation choice. If 'non-negativity' refers to a different property (e.g., entrywise signs in the signed-graph case or a restricted subclass), this must be clarified explicitly in the main text, as it is load-bearing for the claimed basic properties.

Authors: We agree that the abstract phrasing is ambiguous and risks misinterpretation. The Helmholtzian matrix is constructed as an oriented edge Laplacian of the form B^T B (with B the incidence matrix) and is therefore always positive semi-definite, independent of orientation and the presence of odd cycles. The intended meaning of the phrase 'its non-negativity correlates with the odd cycles in G and the orientation on E(G)' was to allude to related properties such as the dimension of the kernel in the signed-graph setting or the definiteness behavior under sign changes, but this was poorly worded. We will revise the abstract to state explicitly that the matrix is always positive semi-definite and will clarify or remove the correlating clause, moving any discussion of signed-graph or cycle-dependent properties to the main text where they can be stated precisely. revision: yes
Referee: [§2 (or equivalent definition section)] The manuscript relies entirely on the external definition from the cited 2026 discretization paper without reproducing the explicit matrix formula or incidence-matrix expression for the Helmholtzian in the present text. This makes the proofs of the eigenvalue coincidence, PSD property, and interlacing non-self-contained; the central claim equating non-zero Laplacian and Helmholtzian spectra would be strengthened by including the definition (presumably B^T D B or equivalent) and the short linear-algebra argument in §2 or §3.

Authors: We accept the referee's point that the current presentation is insufficiently self-contained. Although the definition is referenced, we will add an explicit formula for the Helmholtzian matrix in terms of the incidence matrix B in Section 2. We will also include the short linear-algebra argument establishing that the non-zero eigenvalues of the Helmholtzian coincide with those of the ordinary Laplacian (via the identity between the non-zero spectra of B^T B and BB^T). This addition will render the proofs of positive semi-definiteness, orientation independence, and eigenvalue coincidence fully accessible within the manuscript. revision: yes

Circularity Check

0 steps flagged

Minor self-citation for external definition; central spectral claims derive independently via standard linear algebra

full rationale

The Helmholtzian matrix is introduced by direct citation to the 2026 discretization paper (overlapping authors but prior work). The striking claim equating non-zero Laplacian eigenvalues with those of the Helmholtzian follows immediately from the incidence-matrix construction (Helmholtzian equivalent to a signed/oriented B^T B) and the classical fact that BB^T and B^T B share non-zero spectrum; this is external linear algebra, not a fit or self-definition inside the present manuscript. No parameters are tuned to data, no ansatz is smuggled, and no uniqueness theorem is invoked from self-citation. The remaining results on positive-semidefiniteness, orientation independence, and interlacing are likewise direct consequences of the matrix definition and standard spectral graph theory. The paper is therefore self-contained against external benchmarks, with only a non-load-bearing self-citation for the initial object.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The work rests on the external definition of the Helmholtzian matrix from the cited discretization paper and on standard facts from linear algebra and graph theory; no free parameters are introduced and no new entities beyond the matrix definition itself.

axioms (1)

standard math Standard properties of symmetric matrices and graph Laplacians hold for finite undirected graphs.
Invoked implicitly when stating positive semi-definiteness and eigenvalue interlacing.

invented entities (1)

Helmholtzian matrix no independent evidence
purpose: Edge-indexed analogue of the vector Laplacian for graphs
Defined via the cited prior discretization; no independent falsifiable prediction supplied in the abstract.

pith-pipeline@v0.9.0 · 5502 in / 1396 out tokens · 59635 ms · 2026-05-07T15:51:52.506924+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Helmholzian Spectra of Graphs: Novel Properties
math.CO 2026-05 unverdicted novelty 6.0

The Helmholtzian matrix on graphs admits a classification of graphs with two eigenvalues, a formula for its nullity, and a combinatorial interpretation of its polynomial coefficients.

Reference graph

Works this paper leans on

18 extracted references · cited by 1 Pith paper

[1]

Belardo, Z

F. Belardo, Z. Stani´ c, T. Zaslavsky, Total graph of a signed graph, Ars Math. Contemp., 23 (2023), #P1.02

2023
[2]

Brouwer, W.H

A.E. Brouwer, W.H. Haemers, Spectra of Graphs, Springer, Berlin 2012

2012
[3]

Caro, New Results on the Independence Number, Technical report, Tel Aviv University, 1979

Y. Caro, New Results on the Independence Number, Technical report, Tel Aviv University, 1979

1979
[4]

Chung, L.Y

F. Chung, L.Y. Lu, Complex Graphs and Networks, The American Mathematical Society, New York, 2006

2006
[5]

Cvetkovi´ c, M

D.M. Cvetkovi´ c, M. Doob, H. Sachs, Spectra of Graphs, third edition, Johann Ambrosius Barth, Heidelberg-Leipzig, 1995

1995
[6]

Godsil, G

C. Godsil, G. Royle, Algebraic Graph Theory, Springer, Berlin, 2001

2001
[7]

Jiang, L.-H

X. Jiang, L.-H. Lim, Y. Yao, Y. Ye, Statistical ranking and combinatorial Hodge theory, Math. Program. 127 (2011) 203–244

2011
[8]

Le, Gallai graphs and anti-Gallai graphs, Discrete Math

V.B. Le, Gallai graphs and anti-Gallai graphs, Discrete Math. 159 (1996) 179–189. 11

1996
[9]

S. Li, L. Lu, J.F. Wang, A graph discretization of vector Laplacian, Discrete Appl. Math. 379 (2026) 446–460

2026
[10]

Lim, Hodge Laplacians on graphs, SIAM Rev

L.-H. Lim, Hodge Laplacians on graphs, SIAM Rev. 62 (2020) 685–715

2020
[11]

Schaub, A.R

M.T. Schaub, A.R. Benson, P. Horn, G. Lippner, A. Jadbabaie, Random Walks on Simplicial Com- plexes and the Normalized Hodge 1-Laplacian, SIAM Rev. 62 (2020) 353–391

2020
[12]

Shi, G.R

D.H. Shi, G.R. Chen, Simplicial networks: a powerful tool for characterizing higher-order interac- tions, Nat. Sci. Rev. 9(5) (2022) nwac038

2022
[13]

Simi´ c, Z

S.K. Simi´ c, Z. Stani´ c, Polynomial reconstruction of signed graphs, Linear Algebra Appl. 501 (2016) 390–408

2016
[14]

Stani´ c, Inequalities for Graph Eigenvalues, Cambridge University Press, Cambridge, 2015

Z. Stani´ c, Inequalities for Graph Eigenvalues, Cambridge University Press, Cambridge, 2015

2015
[15]

Watts, S.H

D.J. Watts, S.H. Strogatz, Collective dynamics of ’small world’ networks, Nature 393 (1998) 440–442

1998
[16]

Wei, A lower bound on the stability number of a simple graph, Technical report, Bell Laboratories Technical Memorandum, 1981

V. Wei, A lower bound on the stability number of a simple graph, Technical report, Bell Laboratories Technical Memorandum, 1981

1981
[17]

Wissing, E.R

P. Wissing, E.R. van Dam, Spectral fundamentals and characterizations of signed directed graphs, J. Comb. Theory, Ser. A 187 (2022) 105573

2022
[18]

Zaslavsky, Matrices in the theory of signed simple graphs, in: B.D

T. Zaslavsky, Matrices in the theory of signed simple graphs, in: B.D. Acharya, G.O.H. Katona, J. Neˇ setˇ ril (Eds.), Advances in Discrete Mathematics and Applications: Mysore 2008, Ramanujan Math. Soc., Mysore, 2010, pp. 207–229. 12

2008