{"paper":{"title":"Helmholzian Spectra of Graphs: Novel Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A new graph-theoretic proof confirms that the Helmholtzian matrix represents the graph Helmholtzian operator, classifying graphs with exactly two distinct eigenvalues and giving combinatorial meaning to its polynomial coefficients.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianfeng Wang, Lu Lu, Yi Wang, Yongtang Shi, Zoran Stani\\'c","submitted_at":"2026-05-13T16:12:19Z","abstract_excerpt":"Let $\\grad$, $\\curl$, and $\\dv$ be the graph-theoretic analogues of the gradient, curl, and divergence operators from multivariate calculus. The graph Laplacian $-\\dv \\grad$ gives rise to the celebrated Laplacian matrix, while the matrix representation of the graph Helmholtzian $\\grad \\grad^* + \\curl^* \\curl$ is called the Helmholtzian matrix. In this paper, we present a new graph-theoretic proof that the Helmholtzian matrix indeed represents the graph Helmholtzian. We then investigate the spectral properties of this matrix. Our main results are as follows: (i) a classification of graphs havin"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present a new graph-theoretic proof that the Helmholtzian matrix indeed represents the graph Helmholtzian. Our main results are as follows: (i) a classification of graphs having exactly two distinct Helmholtzian eigenvalues; (ii) the nullity of the Helmholtzian matrix; and (iii) a combinatorial interpretation of the coefficients of the Helmholtzian polynomial.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The graph-theoretic gradient, curl, and divergence operators are defined so that their adjoints and compositions produce a well-defined Helmholtzian operator whose matrix representation is the one studied.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A new graph-theoretic proof confirms that the Helmholtzian matrix represents the graph Helmholtzian operator, classifying graphs with exactly two distinct eigenvalues and giving combinatorial meaning to its polynomial coefficients.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5d178054ce9ab4da3650f64fac7d812a8eba49a827a73bc54432171470377bf6"},"source":{"id":"2605.13733","kind":"arxiv","version":1},"verdict":{"id":"a82fe02c-1184-4de9-84b8-a80df8f95313","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:58:45.693332Z","strongest_claim":"We present a new graph-theoretic proof that the Helmholtzian matrix indeed represents the graph Helmholtzian. Our main results are as follows: (i) a classification of graphs having exactly two distinct Helmholtzian eigenvalues; (ii) the nullity of the Helmholtzian matrix; and (iii) a combinatorial interpretation of the coefficients of the Helmholtzian polynomial.","one_line_summary":"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.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The graph-theoretic gradient, curl, and divergence operators are defined so that their adjoints and compositions produce a well-defined Helmholtzian operator whose matrix representation is the one studied.","pith_extraction_headline":"A new graph-theoretic proof confirms that the Helmholtzian matrix represents the graph Helmholtzian operator, classifying graphs with exactly two distinct eigenvalues and giving combinatorial meaning to its polynomial coefficients."},"references":{"count":64,"sample":[{"doi":"","year":2017,"title":"K. Adiprasito, J. Huh, E. Katz, Hodge Theory of Matroids, Notices Amer. Math. Soc., 64 (2017), pp. 26–30","work_id":"a1aeb17e-0672-4a2e-aa83-692862ec69fa","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"K. Adiprasito, J. Huh, E. Katz, Hodge theory for combinatorial geometries, Ann. Math., 188 (2018), pp. 381–452","work_id":"da5beba4-b645-49b7-8d21-bf5b5c9ec220","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"L. Bartholdi, T. Schick, N. Smale, S. Smale, Hodge theory on metric spaces, Found. Comput. Math., 12 (2012), pp. 1–48","work_id":"c98132cc-961a-4075-82a8-8f1b4642680a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Belardo, Balancedness and the least eigenvalue of Laplacian of signed graphs, Linear Algebra Appl., 446 (2014), pp","work_id":"2db1160d-4485-4236-8182-994e0c38d47b","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"F. Belardo, Z. Stani´ c, T. Zaslavsky, Total graph of a signed graph, Ars Math. Contemp., 23 (2023), #P1.02","work_id":"ee9edade-0ba4-4fe6-8f74-a3390cccfccd","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":64,"snapshot_sha256":"cacec8bfdea56f89e35d0f289a6713a0937226f804d397676629b3b639646095","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"28732f33ab7a8632463a83391be988637f3e78981039255126c02ecc966a7ba4"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}