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

Recognition: 2 theorem links

· Lean Theorem

Helmholzian Spectra of Graphs: Novel Properties

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

Authors on Pith no claims yet

Pith reviewed 2026-05-14 17:58 UTC · model grok-4.3

classification 🧮 math.CO

keywords Helmholtzian matrixgraph spectraeigenvalue classificationgraph nullityHelmholtzian polynomialgraph productsintegral graphs

0 comments

The pith

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.

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

The paper supplies a purely graph-theoretic proof that the Helmholtzian matrix is the matrix representation of the operator built from the graph gradient, curl, and divergence. It classifies every graph whose Helmholtzian matrix has exactly two distinct eigenvalues. The nullity of the matrix is computed in general, and the coefficients of the Helmholtzian characteristic polynomial are shown to count certain combinatorial objects. The same framework yields explicit spectra for selected graph products, a characterization of Helmholtzian integral graphs, and bounds on the smallest eigenvalue.

Core claim

We present a new graph-theoretic proof that the Helmholtzian matrix indeed represents the graph Helmholtzian. Our main results are a classification of graphs having exactly two distinct Helmholtzian eigenvalues, the nullity of the Helmholtzian matrix, and a combinatorial interpretation of the coefficients of the Helmholtzian polynomial. We also determine the Helmholtzian spectrum for certain graph products, characterize Helmholtzian integral graphs, and derive bounds for the smallest Helmholtzian eigenvalue.

What carries the argument

The Helmholtzian matrix, defined as the matrix representation of the operator grad grad^* + curl^* curl where grad, curl, and dv are the graph analogues of the gradient, curl, and divergence operators.

If this is right

All graphs having exactly two distinct Helmholtzian eigenvalues are completely classified.
The nullity of the Helmholtzian matrix is determined for arbitrary graphs.
The coefficients of the Helmholtzian polynomial admit a direct combinatorial interpretation.
Explicit Helmholtzian spectra are obtained for certain graph products.
Helmholtzian integral graphs are characterized and bounds on the smallest eigenvalue are established.

Where Pith is reading between the lines

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

The combinatorial reading of the polynomial coefficients may produce new counting results for walks or subgraphs.
The two-eigenvalue classification may overlap with or refine existing families such as strongly regular graphs.
The same operator-construction technique could be applied to higher-order Hodge Laplacians on graphs or simplicial complexes.
Bounds on the smallest eigenvalue supply a concrete test for expansion or connectivity in networks modeled by these graphs.

Load-bearing premise

The graph-theoretic gradient, curl, and divergence are defined so that their adjoints compose to produce a Helmholtzian operator whose matrix is exactly the one under study.

What would settle it

A concrete graph whose Helmholtzian matrix spectrum fails to match the operator properties, or a graph with exactly two distinct Helmholtzian eigenvalues that lies outside the classified families, would falsify the main claims.

Figures

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

**Figure 1.** Figure 1: The graph G, Λ(G) and ΛR(G). (a) the vertex set is V = E(G); (b) there are △(e) + 2 loops with sign 1 attached at every vertex e; (c) the set of edges with sign 1 is E+ = {{e, e′} | e ±∼ e ′ and e ̸△ e ′}; (d) the set of edges with sign −1 is E− = {{e, e′} | e ↔ e ′ and e ̸△ e ′}. The previous signed graph can be viewed as a combination of the Gallai graph and the standard signed line graph [38]. Apparentl… view at source ↗

read the original abstract

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 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. Furthermore, we determine the Helmholtzian spectrum for certain graph products and characterize Helmholtzian integral graphs, as well as derive bounds for the smallest Helmholtzian eigenvalue. Meanwhile, we pose some open problems for future research.

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 classification of graphs with exactly two Helmholtzian eigenvalues plus the combinatorial reading of the polynomial coefficients are the concrete new pieces.

read the letter

The paper's main contributions are a classification of graphs having exactly two distinct Helmholtzian eigenvalues, a nullity formula for the Helmholtzian matrix, and a combinatorial interpretation of the coefficients of the Helmholtzian polynomial. They also give spectra for certain graph products, characterize integral graphs, and bound the smallest eigenvalue. The graph-theoretic proof that the matrix equals grad grad* + curl* curl is presented as new and independent of prior matrix work, which is the part that feels like a genuine step forward rather than just another matrix definition. That proof lets the later results sit on an operator foundation instead of floating as linear algebra alone. The classification and coefficient interpretation look usable in the same way Laplacian results get used for counting or partitioning graphs. The nullity and eigenvalue bounds are straightforward extensions that follow once the operator is in place. The soft spot is the adjoint identities for the chosen inner products on vertices, edges, and faces. The stress-test note is right to flag this: if the incidence matrices do not satisfy the adjoint relation entrywise under the declared inner products and orientation conventions, then the eigenvalues and classifications apply to a different operator than the one named. The abstract says they supply a new proof, so presumably the details pin this down, but that is the section a referee should examine first. Nothing else looks load-bearing or circular. The work is incremental and stays within spectral graph theory. It is aimed at people who already know Laplacian spectra and want the Helmholtzian analogue for network or chemical applications. A reader outside that niche will not get much. I would send it to peer review. The specific theorems are checkable and the operator justification is worth referee time even if it needs tightening.

Referee Report

2 major / 2 minor

Summary. The manuscript presents a graph-theoretic proof that the Helmholtzian matrix is the matrix representation of the operator grad grad^* + curl^* curl, where grad, curl, and dv are the discrete analogues of the gradient, curl, and divergence. It then classifies graphs possessing exactly two distinct Helmholtzian eigenvalues, determines the nullity of the Helmholtzian matrix, supplies a combinatorial interpretation of the coefficients in the Helmholtzian characteristic polynomial, computes the spectrum for selected graph products, characterizes Helmholtzian integral graphs, and establishes bounds on the smallest Helmholtzian eigenvalue.

Significance. If the operator-matrix equivalence and the subsequent combinatorial results hold, the work supplies concrete tools for extracting spectral information directly from graph structure without heavy reliance on linear-algebraic machinery. The classification and nullity statements, together with the polynomial-coefficient interpretation, would constitute verifiable advances in discrete spectral theory analogous to known results for the ordinary Laplacian.

major comments (2)

[Proof of operator-matrix equivalence (early sections)] The central proof that the studied matrix equals grad grad^* + curl^* curl rests on the adjoint identities for the chosen inner products on vertex, edge, and face spaces. The manuscript treats these identities as immediate from the incidence-matrix definitions, yet no explicit verification (entrywise or via the precise normalization conventions) is supplied; any mismatch in orientation or scaling would make the eigenvalue classification, nullity formula, and polynomial coefficients refer to a different operator.
[Classification theorem] The classification of graphs with exactly two distinct Helmholtzian eigenvalues (result (i)) is stated without an accompanying table or exhaustive check on small graphs; the proof sketch appears to rely on the same unverified adjoint relations, rendering the claim load-bearing on the equivalence step.

minor comments (2)

[Preliminaries] Notation for the inner products on the edge and face spaces is introduced without an explicit formula; a displayed equation would clarify the normalization used for the adjoint relations.
[Helmholtzian polynomial] The combinatorial interpretation of the Helmholtzian polynomial coefficients is asserted but the bijection or counting argument is only sketched; a short example on a small graph (e.g., C_4 or K_3) would make the claim concrete.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thorough review and valuable suggestions. We address the major comments below and will incorporate the necessary revisions to strengthen the manuscript.

read point-by-point responses

Referee: [Proof of operator-matrix equivalence (early sections)] The central proof that the studied matrix equals grad grad^* + curl^* curl rests on the adjoint identities for the chosen inner products on vertex, edge, and face spaces. The manuscript treats these identities as immediate from the incidence-matrix definitions, yet no explicit verification (entrywise or via the precise normalization conventions) is supplied; any mismatch in orientation or scaling would make the eigenvalue classification, nullity formula, and polynomial coefficients refer to a different operator.

Authors: We agree that an explicit verification of the adjoint identities is essential to confirm the equivalence under the chosen inner products and normalizations. In the revised version, we will add a dedicated subsection providing entrywise computations of the adjoints for the incidence matrices, explicitly addressing orientation conventions and scaling factors. This will rigorously establish that the Helmholtzian matrix represents grad grad^* + curl^* curl. revision: yes
Referee: [Classification theorem] The classification of graphs with exactly two distinct Helmholtzian eigenvalues (result (i)) is stated without an accompanying table or exhaustive check on small graphs; the proof sketch appears to rely on the same unverified adjoint relations, rendering the claim load-bearing on the equivalence step.

Authors: The classification is based on the spectral analysis following the operator equivalence. To address the concern, we will include in the revision an exhaustive enumeration and table of Helmholtzian spectra for all graphs with up to 7 vertices, verifying the two-eigenvalue cases. We will also expand the proof to explicitly invoke the verified adjoint relations from the updated equivalence section. revision: yes

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper rests on the standard definitions of the discrete gradient, curl, and divergence operators and on the algebraic properties of their adjoints; no free parameters are introduced and no new entities are postulated.

axioms (1)

domain assumption The graph operators grad, curl, and dv satisfy the adjoint relations and composition rules that define the Helmholtzian operator.
Invoked when the matrix representation is asserted to equal the operator.

pith-pipeline@v0.9.0 · 5475 in / 1163 out tokens · 31312 ms · 2026-05-14T17:58:45.693332+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

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

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 3.3.8. η_H(G) = m(G) - n(G) - t_G(△) + w(G)

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

64 extracted references · 2 canonical work pages · 1 internal anchor

[1]

Adiprasito, J

K. Adiprasito, J. Huh, E. Katz, Hodge Theory of Matroids, Notices Amer. Math. Soc., 64 (2017), pp. 26–30

2017
[2]

Adiprasito, J

K. Adiprasito, J. Huh, E. Katz, Hodge theory for combinatorial geometries, Ann. Math., 188 (2018), pp. 381–452

2018
[3]

Bartholdi, T

L. Bartholdi, T. Schick, N. Smale, S. Smale, Hodge theory on metric spaces, Found. Comput. Math., 12 (2012), pp. 1–48

2012
[4]

Belardo, Balancedness and the least eigenvalue of Laplacian of signed graphs, Linear Algebra Appl., 446 (2014), pp

F. Belardo, Balancedness and the least eigenvalue of Laplacian of signed graphs, Linear Algebra Appl., 446 (2014), pp. 133–147

2014
[5]

Belardo, Z

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

2023
[6]

Brandst¨ adt, V.B

A. Brandst¨ adt, V.B. Le, J.P. Spinrad, Graph Classes: A Survey, SIAM, Philadelphia, PA, 1999

1999
[7]

Brouwer, W.H

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

2012
[8]

Chuang, The Laplacian of a hypergraph

F.R.K. Chuang, The Laplacian of a hypergraph. In: Proc. of a DIMACS Workshop, Discrete Math. Theoret. Comput. Sci., vol. 10, pp. 21–36. Am. Math. Soc., Providence (1993)

1993
[9]

Chung, Spectral Graph Theory, The American Mathematical Society, New York, 1997

F.R.K. Chung, Spectral Graph Theory, The American Mathematical Society, New York, 1997

1997
[10]

Chung, L.Y

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

2006
[11]

Collatz, U

L. Collatz, U. Sinogowitz, Spektren endlicher grafen, Abh. Math. Semin. Univ. Hamb., 21 (1957), pp. 63–77

1957
[12]

Cvetkovi´ c, M

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

1995
[13]

Cvetkovi´ c, P

D.M. Cvetkovi´ c, P. Rowlinson, S. Simi´ c, An Introduction to the Theory of Graph Spectra, Cambridge University Press, Cambridge, 2010

2010
[14]

Cvetkovi´ c, S.K

D. Cvetkovi´ c, S.K. Simi´ c, Graph spectra in Computer Science, Linear Algebra Appl., 434 (2011), pp. 1545–1562

2011
[15]

van Dam, Graphs with Few Eigenvalues

E.R. van Dam, Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra, Doctoral Thesis, Tilburg University, 1996

1996
[16]

van Dam, J.H

E.R. van Dam, J.H. Koolen, A new family of distance-regular graphs with unbounded diameter, Invent. Math. 162 (2005), 189–193

2005
[17]

Dodziuk, Finite-difference approach to the Hodge theory of harmonic forms, Amer

J. Dodziuk, Finite-difference approach to the Hodge theory of harmonic forms, Amer. J. Math. 98 (1976) 79–104

1976
[18]

Doob, Graphs with a small number of distinct eigenvalues, Ann

M. Doob, Graphs with a small number of distinct eigenvalues, Ann. N.Y. Acad. Sci. 175 (1970) 104–110

1970
[19]

Duval, C

A. Duval, C. Klivans and J. Martin, Simplicial matrix-tree theorems, Trans. Amer. Math. Soc. 361(11) (2009) 6073–6114

2009
[20]

Eckmann, Harmonische Funktionen und Randwertaufgaben in einem Komplex, Comment

B. Eckmann, Harmonische Funktionen und Randwertaufgaben in einem Komplex, Comment. Math. Helv. 17 (1944) 240–255

1944
[21]

Fiedler, Algebraic connectivity of graphs, Czechoslovak Math

M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Math. J. 23 (1973) 298–305

1973
[22]

Gagneur, R

J. Gagneur, R. Krause, T. Bouwmeester, G. Casari, Modular decomposition of protein-protein in- teraction networks, Genome Biol. 5 (2004) R57. 22

2004
[23]

Gantmacher, The Theory of Matrices, vol

F.R. Gantmacher, The Theory of Matrices, vol. 1, The American Mathematical Society, New York, 2000

2000
[24]

Godsil, G

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

2001
[25]

Goldberg, Combinatorial Laplacians of Simplicial Complexes, Senior Thesis, Bard, College, 2002

T.E. Goldberg, Combinatorial Laplacians of Simplicial Complexes, Senior Thesis, Bard, College, 2002

2002
[26]

Hammack, W

R. Hammack, W. Imrich, S. Klavˇ zar, Handbook of Product Graphs, Second edition, CRC Press, New York, 2011

2011
[27]

Harary, A.J

F. Harary, A.J. Schwenk, Which graphs have integral spectra? in: R. Bari, F. Harary (Eds.), Graphs and Combinatorics, Lecture Notes in Mathematics, Vol. 406, Springer, Berlin, 1974, pp. 45–51

1974
[28]

Hasan, V

M.A. Hasan, V. Dave, Triangle Counting in Large Networks: A Review, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 8(2) (2018) e1226

2018
[29]

Helfgott, M

H. Helfgott, M. Radziwi l l, Expansion, divisibility and parity, arXiv:2103.06853v2

work page arXiv
[30]

Hodge, The Theory and Applications of Harmonic Integrals, Cambridge University Press, Cambridge, 1941

W.V.D. Hodge, The Theory and Applications of Harmonic Integrals, Cambridge University Press, Cambridge, 1941

1941
[31]

Horak, J

D. Horak, J. Jost, Spectra of combinatorial Laplace operators on simplicial complexes, Adv. Math. 244 (2013) 303–336

2013
[32]

Huang, Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture, Ann

H. Huang, Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture, Ann. Math. 190 (2019) 949–955

2019
[33]

Huh, Combinatorics and Hodge theory, Proc

J. Huh, Combinatorics and Hodge theory, Proc. Int. Cong. Math. 1 (2022) 2–28

2022
[34]

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
[35]

Jiang, J

Z.L. Jiang, J. Tidor, Y. Yao, S.T. Zhang and Y.F. Zhao, Equiangular lines with a fixed angle, Ann. Math. 194 (2021) 729–743

2021
[36]

Kepner, Graph Challenge, https://graphchallenge.mit.edu

J. Kepner, Graph Challenge, https://graphchallenge.mit.edu. Accessed: 2020, April 08

2020
[37]

W. Kook, V. Reiner, D. Stanton, Combinatorial Laplacians of matroid complexes, J. Amer. Math. Soc. 13 (2000) 129–148

2000
[38]

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

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

1996
[39]

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

2026
[40]

Lim, Hodge Laplacians on graphs, SIAM Rev

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

2020
[41]

L. Lu, Y.T. Shi, Z. Stani´ c, J.F. Wang, Y. Wang, Helmholzian spectra of graphs: basic properties, arXiv:2605.03478v1

work page internal anchor Pith review Pith/arXiv arXiv
[42]

Mahadev, U.N

V.N. Mahadev, U.N. Peled, Threshold Graphs and Related Topics, Elsevier, Oxford, 1995

1995
[43]

Matom¨ aki, M

K. Matom¨ aki, M. Radziwi l l, T. Tao, Sign patterns of the M¨ obius and Liouville functions, Forum Math. Sigma, 4 (2016) e14

2016
[44]

Merris, Laplacian matrices of graphs: a survey, Linear Algebra Appl

R. Merris, Laplacian matrices of graphs: a survey, Linear Algebra Appl. 197–198 (1994) 143–176

1994
[45]

Merris, Laplacian graph eigenvectors, Linear Algebra Appl

R. Merris, Laplacian graph eigenvectors, Linear Algebra Appl. 278 (1998) 221–236

1998
[46]

Mieghem, Graph Spectra for Complex Networks, Cambridge University Press, New York, 2011

P.V. Mieghem, Graph Spectra for Complex Networks, Cambridge University Press, New York, 2011. 23

2011
[47]

Muhammad, M

A. Muhammad, M. Egerstedt, Control using higher order Laplacians in network topologies, in: Mathematical Theory of Networks and Systems, Kyoto, Japan, 2006, pp. 1024–1038

2006
[48]

Nakano, S

K. Nakano, S. Olariu, A. Zomaya, A time-optimal solution for the path cover problem on cographs, Theoret. Comput. Sci. 290 (2003) 1541–1556

2003
[49]

Pandey, Z

S. Pandey, Z. Wang, S. Zhong, C. Tian, B. Zheng, X. Li, L. Li, A. Hoisie, C. Ding and D. Li et al, TRUST: Triangle Counting Reloaded on GPUs, IEEE Trans. Par. Dis. Sys. 32 (2021) 2646–2660

2021
[50]

Randi´ c, M

M. Randi´ c, M. Noviˇ c, D. Plavˇ si´ c, Solved and Unsolved Problems of Structural Chemistry, CRC Press, Boca Raton, 2016

2016
[51]

Rezvani, W

M. Rezvani, W. Liang, C. Liu, J.X. Yu, Efficient detection of overlapping communities using asym- metric triangle cuts, IEEE Trans. Know. Data Engin. 30 (2018) 2093–2105

2018
[52]

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
[53]

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
[54]

Steenbergena, C

J. Steenbergena, C. Klivans, S. Mukherjee, A Cheeger-type inequality on simplicial complexes, Adv. Appl. Math. 56 (2014) 56–77

2014
[55]

Stani´ c, Regular Graphs

Z. Stani´ c, Regular Graphs. A Spectral Approach, De Gruyter, Berlin, 2017

2017
[56]

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

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

2015
[57]

Tahbaz-Salehi, A

A. Tahbaz-Salehi, A. Jadbabaie, Distributed coverage verification in sensor networks without location information, IEEE Trans. Automat. Control 55 (8) (2010) 1837–1849

2010
[58]

Tao, The logarithmically averaged Chowla and Elliott conjectures for two-point correlations, Forum Math

T. Tao, The logarithmically averaged Chowla and Elliott conjectures for two-point correlations, Forum Math. Pi, 4 (2016) e8

2016
[59]

J.F. Wang, J. Wang, M. Brunetti, F. Belardo, L.G. Wang, Developments on the Hoffman program of graphs, Adv. Appl. Math. 169 (2025) 102915

2025
[60]

Warner, Foundations of Differentiable Manifolds and Lie Groups, Grad

F.W. Warner, Foundations of Differentiable Manifolds and Lie Groups, Grad. Texts in Math. 94, Springer-Verlag, New York, 1983

1983
[61]

Watts, S.H

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

1998
[62]

Z.H. Wu, S.R. Pan, F.W. Chen, G.D. Long, C.Q. Zhang, P.S. Yu, A comprehensive survey on graph neural networks, IEEE Trans. Neural Netw. Learn. Syst. 32 (2021) 4–24

2021
[63]

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

2008
[64]

Zhang, Y

H. Zhang, Y. Zhu, L. Qin, H. Cheng, J.X. Yu, Efficient MapReduce algorithms for triangle listing in billion-scale graphs, Distrib. Parallel Databases 35 (2017) 149–176. 24

2017