Pith. sign in

REVIEW 3 major objections 6 minor 300 references

Spectral Theory of Hypergraphs: A Survey

T0 review · 3 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This survey claims that uniform-hypergraph spectral theory is best organized around the normalized adjacency hypermatrix.

desk verdict A broad, current survey with a real consistency problem in Section 3.1 and a duplicated factor in Theorem 4.9; fixable, but not citeable as is. read the letter →

arxiv 2507.13664 v1 pith:IOIMDLOG submitted 2025-07-18 math.HO math.COmath.SP

Shashwath S Shetty , K Arathi Bhat This is my paper · ORCID
classification math.HOmath.COmath.SP MSC 05C6515A1815A42
keywords TensorHypermatrixHypergraphSpectralRadiusCharacteristicpolynomialMatchingUniformEstradaindex
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper is a survey that tries to show that the spectral theory of uniform hypergraphs can be organized around one object: the normalized adjacency hypermatrix. It collects the core results of the field—eigenvalue definitions and computations, bounds on the spectral radius, spectral Turán problems, characteristic and matching polynomials, and the Estrada index—and presents them as consequences of that hypermatrix framework. If the survey is right, a reader who understands hypermatrix eigenvalues and resultants has a shorter path into the field's main theorems without reconstructing them from scattered papers. The paper motivates the theory with applications in computer science, quantum physics, and chemistry, but its content is purely mathematical.

What carries the argument

The load-bearing object is the normalized adjacency hypermatrix $A(H)$ of a uniform hypergraph $H$: the order-$h$, dimension-$n$ tensor whose nonzero entries are $\frac{1}{(h-1)!}$ for each hyperedge, with eigenvalues defined by $A(H)x^{h-1}=\lambda x^{[h-1]}$. This object carries the argument because every surveyed topic—spectral radius, characteristic polynomial, spectral moments, matching polynomial, Estrada index—is expressed through its spectrum. The supporting machinery includes resultants and symmetric hyperdeterminants for defining eigenvalues, generalized trace formulas for computing characteristic polynomials, the Perron–Frobenius theorem for nonnegative hypermatrices for spectral-radius bounds, and combinatorial counting via Veblen hypergraphs, Eulerian digraphs, and elementary subgraphs for closed-form trace and coefficient formulas.

What would settle it

Check the two displayed bounds for $\operatorname{spexlin}_h(n, B_h(C_4))$ in Section 3.1 against the cited sources [226] and [112]; if either transcription is wrong, the survey's reliability as a reference fails. Independently, compare Theorem 4.9's factor $(\lambda^h - 3 + \sqrt{5}/2)$ with the source [74] and correct the sign if it is a typo.

Watch

Extended reading notes

Core claim

The paper's central claim, on its own terms, is that the spectral theory of uniform hypergraphs can be organized around the normalized adjacency hypermatrix, with most of the field's main results appearing as theorems about this tensor. The survey arranges the results by theme: eigenvalue characterizations, spectral radius, extremal and Turán-type problems, hypertrees, characteristic polynomials, matching polynomials, and the Estrada index. It further claims that algebraic tools—resultants, generalized traces, and combinatorial counting—form the computational route to these spectra.

Load-bearing premise

The survey's value as an overview depends on every quoted theorem being transcribed accurately from the source, an assumption the manuscript itself calls into question with conflicting displays in Section 3.1 and a malformed factor in Theorem 4.9.

Editorial extensions

If this is right

  • A newcomer to the field can use the normalized adjacency hypermatrix as the single entry point, since most surveyed results are stated as properties of this tensor.
  • Spectral-radius bounds for uniform hypergraphs follow from Perron–Frobenius theory of nonnegative hypermatrices, including the min–max row-sum bound with equality exactly for regular hypergraphs.
  • Characteristic polynomials of structured hypergraphs—single edges, hyperstars, hyperpaths, hypercycles, and power hypergraphs—are available in closed form through resultants and generalized traces.
  • Among hypertrees of fixed size, the hyperpath attains the smallest spectral radius and the smallest Estrada index, while the hyperstar attains the largest, by the survey's Theorems 3.46 and 4.36.
  • The matching polynomial of a hypertree relates to its characteristic polynomial through a product over connected sub-hypertrees, giving a hypergraph analogue of the classical graph result.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A reader can treat the survey's frame as a glossary: every theorem that fits is a statement about the normalized adjacency hypermatrix, while general non-uniform hypergraphs and p-spectral radii are declared boundaries of the map.
  • One concrete extension of the survey's thesis is to test whether the normalization is doing real work: if the same results were stated for the unnormalized adjacency hypermatrix and many changed materially, the normalized object is a substantive choice rather than a convention.
  • The survey's explicit recurrences and closed-form formulas could be compiled into a small computer-algebra toolkit for spectra of uniform hypergraphs, which would also expose any remaining transcription errors automatically.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. Summary: The manuscript is a survey of the spectral theory of uniform hypergraphs developed through the normalized adjacency hypermatrix (tensor). It collects definitions and background on hypermatrices, resultants, and traces; surveys results on eigenvalues, spectral radius bounds, spectral Turán-type problems, hypertrees, and characteristic polynomials; and closes with polynomial reconstruction, matching polynomials, spectral moments, and the Estrada index. All results are quoted from the literature, with citations, and no new theorems are claimed. The paper's value depends on the accuracy and internal consistency of these quotations.

Significance. Significance: If the transcriptions were reliable, this would be a convenient entry point to a fast-growing area, and the bibliography (approximately 300 references, many from 2020–2025) is genuinely useful. The organizational structure, the explicit attribution of each theorem, and the inclusion of recent work (e.g., Theorem 2.5, Theorem 4.10, and Section 4.1) are positive features. However, because the paper is a secondary source, its central claim to provide an accurate overview is compromised by the internal contradiction in Section 3.1 and the mis-printed factor in Theorem 4.9. These are not cosmetic: a reader using the survey as a reference cannot determine the correct bound for spexlin_h(n, B_h(C_4)) or the correct characteristic polynomial of C_4^(h) without returning to the original papers.

major comments (3)
  1. [Section 3.1 (Spectral Turán type problems)] The text reports from [226] that for any δ > 0 and large enough n, n^{1−δ} < spexlin_h(n, B_h(C4)) = O(n), and then from [112] that spexlin_h(n, B_h(C4)) ≤ √n/(h−1) + O(1). For fixed h ≥ 2, the latter upper bound is o(n^{1−δ}) for any δ < 1/2, so the two statements cannot both hold for the same extremal function. The survey must clarify whether the two bounds concern different families (e.g., induced versus non-induced Berge–C4, or different uniformity constraints), or one of the attributions must be corrected.
  2. [Theorem 4.9] The displayed characteristic polynomial for the h-uniform hypercycle C_4^(h) contains the factor (λ^h − 3 + √5/2)^{c'} twice. Since Theorem 4.8 for C_3 has three distinct linear factors, the second factor should be (λ^h − 3 − √5/2)^{c'} (as in the source [74]). As printed, the theorem is mathematically incorrect and cannot be used as a reference formula.
  3. [Theorems 3.42 and 3.60 (and the first bullet of Section 3.1)] The symbol r is used without definition or with inconsistent meaning. In Theorem 3.42, the bound (1 − r y_u^h)ρ(H) ≤ ρ(H−u) ≤ ρ(H) is uninterpretable unless r is specified (presumably r = h, the uniformity). In Theorem 3.60, the hypergraph is stated as T ∈ mT(r), while the exponents and the extremal hypergraph S((h−1)^{(t_1)}, t_3, 0^{(t_2)}) use h; the two symbols also appear together in the equation m = t_1 r + t_2 + t_3 + 1. The same undefined r appears in the condition 4n(q−2) ≥ (2h^2 − 4r + 1)^2 and in the bound in the first bullet of Section 3.1. Consistency between h and r must be enforced throughout.
minor comments (6)
  1. [Section 1.3 (heading)] The heading 'Resultatnt' should read 'Resultant'.
  2. [Section 3.2] The sentence 'Hence h-uniform hypertee is h-symmetric' contains a typo: 'hypertee' should be 'hypertree'.
  3. [Section 3 (before the paragraph on Lu and Man)] The phrase 'with with largest eigenvalue' has a duplicated word 'with'.
  4. [Section 3.1] The phrase 'A h-uniform F an' should be 'A h-uniform fan'.
  5. [Theorem 1.10] The definition of the Schur polynomial is garbled: the summation upper limit is typeset as 't∑ h=1', and the generating function exp(∞∑ h=1 x_h z^h) should use an index j rather than h, with P_t defined as a sum over t_1+...+t_h = t.
  6. [Theorem 4.5] In the piecewise definition of c(i,m), the first case reads 'j = m' but the variable is i; it should be 'i = m'.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the survey compiles independently cited external results; transcription inconsistencies are correctness concerns, not circular reasoning.

full rationale

This paper is a survey, not a derivation. Its stated purpose is to give an overview of spectral theory of uniform hypergraphs via the normalized adjacency hypermatrix, and every substantive theorem is quoted from an external published source with a citation (e.g., Cooper–Dutle [56], Qi [206], Shao–Qi–Hu [223], Chen–van Dam–Bu [42]). There is no new parameter fitted to data and then renamed as a prediction, no conclusion derived from a quantity that is defined in terms of the target result, and no uniqueness theorem invoked from the present authors' own prior work to force a choice. The two concrete internal inconsistencies mentioned by the reader (the conflicting bounds for spexlin_h(n, B_h(C4)) in §3.1 and the duplicated factor (λ^h − 3 + √5/2)^{c′} in Theorem 4.9) are potential transcription/reliability defects in the surveying claim, but they do not make any derivation circular: the survey's statements are not used as premises to prove the quoted theorems. Self-citation is absent as a load-bearing element; the authors thank Cooper but do not cite their own previous work to justify any assertion. Therefore the appropriate circularity score is 0.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

The survey introduces no new free parameters, axioms specific to the paper, or invented entities. It relies entirely on background mathematics and the correctness of the cited theorems.

assumptions (2)
  • standard math The standard definitions and properties of hypergraphs, hypermatrices, resultants, and tensor eigenvalues are taken as background.
    Sections 1.1-1.4 introduce these concepts without proof, assuming the reader's familiarity or acceptance of them as foundational.
  • domain assumption All quoted theorems from the cited literature are stated accurately in the survey.
    A survey does not reproduce proofs; its usefulness depends on accurate transcription. The paper itself acknowledges this implicitly by citing sources for every result.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Spectral Theory of Hypergraphs: A Survey." pith.science (2026). https://pith.science/paper/IOIMDLOG

@misc{pith2026250713664,
  author       = {Pith},
  title        = {Pith review of: Spectral Theory of Hypergraphs: A Survey},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IOIMDLOG}},
  note         = {Machine review of arXiv:2507.13664}
}
read the original abstract

Hypergraphs require higher-dimensional representations, which makes it more difficult to compute and interpret their spectral properties. This survey article uses the framework of hypermatrices to give an in-depth overview of the spectral theory of hypergraphs. Our focus in this article relies on the theoretical aspects of hypergraphs that help to ease the computational methods. Spectral theory hypergraphs, one of the most advanced fields of study, are constantly finding novel applications in various domains such as theoretical computer science, quantum physics, and theoretical chemistry, among many others. We start our journey by introducing hypergraphs, hypermatrices (tensors), resultants, and their properties. We outline some of the results used to determine the adjacency spectrum of hypergraphs and go over some of the groundbreaking findings in the development of the theory. On passing through a list of bounds for the spectral radius of uniform hypergraphs, we will have a look into the spectral versions of Tur\'an-type problems in hypergraphs. Finally, in addition to the Estrada index of hypergraphs, some significant results related to the characteristic polynomial and its relationship with the matching polynomial are presented.

Figures

Figures reproduced from arXiv: 2507.13664 by the authors.

Figure 2
Figure 2. The 4- uniform squid. Yue et al. [278] have obtained the largest eigenvalue of a sunflower (power hypergraph) and a squid (cored hypergraph). The pictorial depiction of a 5-uniform sunflower and a 4-uniform squid are given in [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗
Figure 3
Figure 3. 3- uniform hyperpath with 5 hyperedges [PITH_FULL_IMAGE:figures/full_fig_p025_3.png] view at source ↗
Figure 5
Figure 5. 3-uniform Veblen hypergraph Theorem 4.15. [251][Veblen’s Theorem] A (multi) graph can be decomposed into disjoint cycles if and only if the degree of every vertex is even [PITH_FULL_IMAGE:figures/full_fig_p032_5.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 75 canonical work pages

  1. [226]

    She, Y.-Z

    C.-M. She, Y.-Z. Fan, and L. Kang. Spectral bipartite T ur´ an problems on linear hypergraphs. Discrete Mathematics , 348(6):114435, 2025

    2025

  2. [112]

    Y. Hou, A. Chang, and J. Cooper. Spectral extremal resu lts for hypergraphs. The Electronic Journal of Combinatorics , 28:P3–46, 2021

    2021

  3. [74]

    C. Duan, L. Wang, and Y. Wei. The characteristic polynom ials of uni- form hypercycles with length four. Applied Mathematics and Computation , 477:128821, 2024

    2024

  4. [1]

    S. G. Aksoy, C. Joslyn, C. O. Marrero, B. Praggastis, and E . Purvine. Hyper- network science via high-order hypergraph walks. EPJ Data Science , 9(1):16, 2020

    2020

  5. [2]

    A. S. Anokhina, A. Y. Morozov, and S. R. Shakirov. Resulta nt as the deter- minant of a koszul complex. Theoretical and Mathematical Physics , 160:1203– 1228, 2009

    2009

  6. [3]

    Bai and L

    S. Bai and L. Lu. A bound on the spectral radius of hypergra phs with e edges. Linear Algebra and its Applications , 549:203–218, 2018

    2018

  7. [4]

    Banerjee

    A. Banerjee. On the spectrum of hypergraphs. Linear algebra and its appli- cations, 614:82–110, 2021

    2021

  8. [5]

    Banerjee and A

    A. Banerjee and A. Char. On the spectrum of directed unifo rm and non- uniform hypergraphs. arXiv preprint arXiv:1710.06367 , 2017

    arXiv 2017

Show all 300 references
  1. [6]

    Banerjee, A

    A. Banerjee, A. Char, and B. Mondal. Spectra of general hy pergraphs. Linear Algebra and its Applications , 518:14–30, 2017

    2017

  2. [7]

    Bao, Y.-Z

    Y.-H. Bao, Y.-Z. Fan, Y. Wang, and M. Zhu. A combinatorial method for computing characteristic polynomials of starlike hypergr aphs. Journal of Al- gebraic Combinatorics , 51:589–616, 2020

    2020

  3. [8]

    Battiston, G

    F. Battiston, G. Cencetti, I. Iacopini, V. Latora, M. Luc as, A. Patania, J.-G. Young, and G. Petri. Networks beyond pairwise interactions : Structure and dynamics. Physics reports, 874:1–92, 2020

    2020

  4. [9]

    Baymani and M

    A. Baymani and M. N. Soorki. Electrophysiological model ing and interactive approaches of electrical circuits and hypergraphs for unde rstanding neural circuit dynamics. In 2024 15th International Conference on Information and Knowledge Technology (IKT) , pages 47–52. IEEE, 20...

    2024

  5. [10]

    C. Berge. Hypergraphs: combinatorics of finite sets , volume 45. Elsevier, North Holland, 1984

    1984

  6. [11]

    P. Bikker. On bezout’s method for computing the resulta nt. RISC-Linz Report Series, Johannes Kepler University, Linz, Austria , 1995

    1995

  7. [12]

    Bıyıkoglu and J

    T. Bıyıkoglu and J. Leydold. Graphs with given degree se quence and maximal spectral radius. the electronic journal of combinatorics , 15(R119):1, 2008

    2008

  8. [13]

    Boulet and B

    R. Boulet and B. Jouve. The lollipop graph is determined by its spectrum. The Electronic Journal of Combinatorics , 15(1):R74, 2008

    2008

  9. [14]

    A. Bretto. Hypergraph theory: an introduction . Springer, New York, 2013

    2013

  10. [15]

    R. A. Brualdi and A. J. Hoffman. On the spectral radius of ( 0, 1)-matrices. Linear Algebra and its Applications , 65:133–146, 1985

    1985

  11. [16]

    C. Bu, X. Jin, H. Li, and C. Deng. Brauer-type eigenvalue inclusion sets and the spectral radius of tensors. Linear Algebra and its Applications , 512:234– 248, 2017

    2017

  12. [17]

    C. Bu, J. Zhou, and Y. Wei. E-cospectral hypergraphs and some hypergraphs determined by their spectra. Linear Algebra and its Applications, 459:397–403, 2014

    2014

  13. [18]

    Cardoso, R

    K. Cardoso, R. Del-Vecchio, L. Portugal, and V. Trevisa n. Adjacency energy of hypergraphs. Linear Algebra and its Applications , 648:181–204, 2022

    2022

  14. [19]

    Cardoso, C

    K. Cardoso, C. Hoppen, and V. Trevisan. The spectrum of a class of uniform hypergraphs. Linear Algebra and its Applications , 590:243–257, 2020

    2020

  15. [20]

    Cardoso and V

    K. Cardoso and V. Trevisan. Principal eigenvectors of g eneral hypergraphs. Linear and Multilinear Algebra , 69(14):2641–2656, 2021

    2021

  16. [21]

    K. d. R. Cardoso and V. Trevisan. Energies of hypergraph s. Electronic Journal of Linear Algebra , 36:293–308, 2020

    2020

  17. [22]

    T.-H. H. Chan, A. Louis, Z. G. Tang, and C. Zhang. Spectra l properties of hypergraph laplacian and approximation algorithms. Journal of the ACM (JACM), 65(3):1–48, 2018

    2018

  18. [23]

    Chang and Q

    A. Chang and Q. Huang. Ordering trees by their largest ei genvalues. Linear algebra and its applications , 370:175–184, 2003

    2003

  19. [24]

    Chang, W

    J. Chang, W. Ding, L. Qi, and H. Yan. Computing the p-spec tral radii of uni- form hypergraphs with applications. Journal of Scientific Computing , 75:1–25, 2018

    2018

  20. [25]

    Chang and Z

    J. Chang and Z. Zhu. An adaptive cubic regularization al gorithm for comput- ing h-and z-eigenvalues of real even-order supersymmetric tensors. Journal of Computational and Applied Mathematics , 428:115195, 2023

    2023

  21. [26]

    Chang, K

    K. Chang, K. Pearson, and T. Zhang. Perron-frobenius th eorem for nonnega- tive tensors. Communications in Mathematical Sciences , 6(2):507–520, 2008

    2008

  22. [27]

    Chang, L

    K. Chang, L. Qi, and T. Zhang. A survey on the spectral the ory of nonnegative tensors. Numerical Linear Algebra with Applications , 20(6):891–912, 2013

    2013

  23. [28]

    Chang, K

    K.-C. Chang, K. J. Pearson, and T. Zhang. Primitivity, t he convergence of the nqz method, and the largest eigenvalue for nonnegative t ensors. SIAM Journal on Matrix Analysis and Applications , 32(3):806–819, 2011

    2011

  24. [29]

    S.-Y. Chang. Algebraic connectivity characterizatio n of ensemble random hy- pergraphs. arXiv preprint arXiv:2310.08700 , 2023. Spectral Theory of Hypergraphs 41

    2023 arXiv

  25. [30]

    M. Chardin. The resultant via a koszul complex. In Computational Algebraic Geometry, pages 29–39. Birkh¨ auser, Boston, MA, 1993

    1993

  26. [31]

    D. Chen, Z. Chen, and X.-D. Zhang. Spectral radius of uni form hypergraphs and degree sequences. Frontiers of Mathematics in China , 12:1279–1288, 2017

    2017

  27. [32]

    H. Chen, Y. Chen, G. Li, and L. Qi. Finding the maximum eig envalue of a class of tensors with applications in copositivity test and hypergraphs. arXiv preprint arXiv:1511.02328 , 2015

    2015 arXiv

  28. [33]

    H. Chen, Y. Chen, G. Li, and L. Qi. A semidefinite program a pproach for computing the maximum eigenvalue of a class of structured te nsors and its applications in hypergraphs and copositivity test. Numerical Linear Algebra with Applications , 25(1):e2125, 2018

    2018

  29. [34]

    Chen and Y

    H. Chen and Y. Wang. On computing minimal h-eigenvalue o f sign-structured tensors. Frontiers of Mathematics in China , 12:1289–1302, 2017

    2017

  30. [35]

    Chen and C

    L. Chen and C. Bu. A reduction formula for the characteri stic polynomial of hypergraph with pendant edges. Linear Algebra and its Applications , 611:171– 186, 2021

    2021

  31. [36]

    Chen and C

    L. Chen and C. Bu. The algebraic multiplicity of the spec tral radius of a uniform hypertree. The Electronic Journal of Combinatorics , pages P4–18, 2024

    2024

  32. [37]

    L. Chen, C. Bu, and J. Zhou. Spectral moments of hypertre es and their ap- plications. Linear and Multilinear Algebra , 70(21):6297–6311, 2022

    2022

  33. [38]

    L. Chen, L. Han, H. Yin, and L. Zhou. A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tenso r. Journal of Com- putational and Applied Mathematics , 355:174–181, 2019

    2019

  34. [39]

    L. Chen, L. Han, and L. Zhou. Computing tensor eigenvalu es via homotopy methods. SIAM Journal on Matrix Analysis and Applications , 37(1):290–319, 2016

    2016

  35. [40]

    L. Chen, L. Sun, and C. Bu. High-order spectral characte rizations of graphs. Discrete Mathematics , 348(6):114421, 2025

    2025

  36. [41]

    L. Chen, E. R. van Dam, and C. Bu. All eigenvalues of the po wer hypergraph and signed subgraphs of a graph. Linear Algebra and its Applications, 676:205– 210, 2023

    2023

  37. [42]

    L. Chen, E. R. van Dam, and C. Bu. Spectra of power hypergr aphs and signed graphs via parity-closed walks. Journal of Combinatorial Theory, Series A , 207:105909, 2024

    2024

  38. [43]

    Chen and J

    Y. Chen and J. Chang. A trust region algorithm for comput ing extreme eigen- values of tensors. Numerical Algebra, Control and Optimization , 10(4):475– 485, 2020

    2020

  39. [44]

    F. R. Chung. The laplacian of a hypergraph. DIMACS Series in Discrete Mathematics and Theoretical computer Science , 10:21–36, 1992

    1992

  40. [45]

    S. M. Cioab˘ a, D. A. Gregory, and V. Nikiforov. Extreme eigenvalues of nonreg- ular graphs. Journal of combinatorial theory, Series B , 97(3):483–486, 2007

    2007

  41. [46]

    S. M. Cioab˘ a, J. H. Koolen, M. Mimura, H. Nozaki, and T. O kuda. On the spectrum and linear programming bound for hypergraphs. European Journal of Combinatorics , 104:103535, 2022

    2022

  42. [47]

    G. J. Clark and J. N. Cooper. On the adjacency spectra of h ypertrees. The Electronic Journal of Combinatorics , 25(2):2–48, 2018. 42 S. S. Shetty and K. A. Bhat

    2018

  43. [48]

    G. J. Clark and J. N. Cooper. Stably computing the multip licity of known roots given leading coefficients. Numerical Linear Algebra with Applications , 27(2):e2275, 2020

    2020

  44. [49]

    G. J. Clark and J. N. Cooper. A harary-sachs theorem for h ypergraphs. Jour- nal of Combinatorial Theory, Series B , 149:1–15, 2021

    2021

  45. [50]

    G. J. Clark and J. N. Cooper. Applications of the harary- sachs theorem for hypergraphs. Linear Algebra and its Applications , 649:354–374, 2022

    2022

  46. [51]

    G. J. Clark, F. Thomaz, and A. T. Stephen. Comparing the p rincipal eigen- vector of a hypergraph and its shadows. Linear Algebra and its Applications , 673:46–68, 2023

    2023

  47. [52]

    Clifton, X

    A. Clifton, X. Liu, R. Mahmoud, and A. Shantanam. Recons truction and edge reconstruction of triangle-free graphs. Discrete Mathematics , 347(2):113753, 2024

    2024

  48. [53]

    J. Cooper. Adjacency spectra of random and complete hyp ergraphs. Linear Algebra and its Applications , 596:184–202, 2020

    2020

  49. [54]

    Cooper, D

    J. Cooper, D. N. Desai, and A. Sahay. Principal eigenvec tors and principal ratios in hypergraph Tur´ an problems.arXiv preprint arXiv:2401.10344 , 2024

    2024 arXiv

  50. [55]

    Cooper and Z

    J. Cooper and Z. Du. Note on the spectra of steiner distan ce hypermatrices. The Electronic Journal of Combinatorics , pages P3–4, 2024

    2024

  51. [56]

    Cooper and A

    J. Cooper and A. Dutle. Spectra of uniform hypergraphs. Linear Algebra and its applications , 436(9):3268–3292, 2012

    2012

  52. [57]

    Cooper and A

    J. Cooper and A. Dutle. Computing hypermatrix spectra w ith the poisson product formula. Linear and Multilinear Algebra , 63(5):956–970, 2015

    2015

  53. [58]

    Cooper and G

    J. Cooper and G. Fickes. Geometric vs algebraic nullity for hyperpaths. arXiv preprint arXiv:2107.01500 , 2021

    2021 arXiv

  54. [59]

    Cooper and U

    J. Cooper and U. Okur. Polynomial reconstruction probl em for hypergraphs. Linear Algebra and its Applications , 692:37–61, 2024

    2024

  55. [60]

    Cooper and G

    J. Cooper and G. Tauscheck. A generalization of the grah am-pollak tree the- orem to even-order steiner distance. Special Matrices, 12(1):20240018, 2024

    2024

  56. [61]

    Cooper and G

    J. Cooper and G. Tauscheck. A generalization of the grah am-pollak tree the- orem to steiner distance. Discrete Mathematics , 347(4):113849, 2024

    2024

  57. [62]

    D. A. Cox, J. Little, and D. O’shea. Using algebraic geometry , volume 185. Springer Science & Business Media, Spring Street, New York, 2005

    2005

  58. [63]

    Cui, Y.-H

    C.-F. Cui, Y.-H. Dai, and J. Nie. All real eigenvalues of symmetric tensors. SIAM Journal on Matrix Analysis and Applications , 35(4):1582–1601, 2014

    2014

  59. [64]

    L.-B. Cui, W. Li, and M. K. Ng. Primitive tensors and dire cted hypergraphs. Linear Algebra and its Applications , 471:96–108, 2015

    2015

  60. [65]

    Cvetkovi´ c and P

    D. Cvetkovi´ c and P. Rowlinson. Spectra of unicyclic graphs. Graphs and com- binatorics, 3(1):7–23, 1987

    1987

  61. [66]

    D. M. Cvetkovic, M. Doob, I. Gutman, and A. Torgaˇ sev. Recent results in the theory of graph spectra , volume 36. Elsevier, North Holland, 1988

    1988

  62. [67]

    D. M. Cvetkovic, M. Doob, and H. Sachs. Spectra of graphs. Theory and application. Academic Press, New York, 1980

    1980

  63. [68]

    C. Deng, L. Sun, and C. Bu. The geometry connectivity of h ypergraphs. Discrete Mathematics , 343(11):112038, 2020. Spectral Theory of Hypergraphs 43

    2020

  64. [69]

    C. Ding, Y. Z. Fan, and J. C. Wan. The linear unicyclic hyp ergraph with the second or third largest spectral radius. Acta Mathematica Sinica, English Series, 36(10):1140–1150, 2020

    2020

  65. [70]

    Z. Du. The spectral radius of steiner distance hypermat rices of graphs. Linear Algebra and its Applications , 2025

    2025

  66. [71]

    C. Duan, E. R. van Dam, and L. Wang. The characteristic po lynomials of uniform double hyperstars and uniform hypertriangles. Linear Algebra and its Applications , 678:16–32, 2023

    2023

  67. [72]

    Duan and L

    C. Duan and L. Wang. Bounds on the spectral radius of gene ral hypergraphs in terms of clique number. Linear Algebra and Its Applications , 610:120–134, 2021

    2021

  68. [73]

    C. Duan, L. Wang, and X. Li. Some properties of the signle ss laplacian and normalized laplacian tensors of general hypergraphs. Taiwanese Journal of Mathematics, 24(2):265–281, 2020

    2020

  69. [75]

    C. Duan, L. Wang, and P. Xiao. Largest signless laplacia n spectral radius of uniform supertrees with diameter and pendent edges (vertic es). Frontiers of Mathematics in China , 15(6):1105–1120, 2020

    2020

  70. [76]

    Dumitriu and Y

    I. Dumitriu and Y. Zhu. Spectra of random regular hyperg raphs. The Elec- tronic Journal of Combinatorics , 28(3), 2021

    2021

  71. [77]

    Duttweiler and N

    L. Duttweiler and N. Reff. Spectra of cycle and path famil ies of oriented hypergraphs. Linear Algebra and its Applications , 578:251–271, 2019

    2019

  72. [78]

    M. N. Ellingham, L. Lu, and Z. Wang. Maximum spectral rad ius of outerpla- nar 3-uniform hypergraphs. Journal of Graph Theory , 100(4):671–685, 2022

    2022

  73. [79]

    Y. Fan, Z. Zhu, and Y. Wang. Least h-eigenvalue of adjace ncy tensor of hyper- graphs with cut vertices. Frontiers of Mathematics in China , 15(3):451–465, 2020

    2020

  74. [80]

    Y.-Z. Fan. On the spectral radius of a class of non-odd-b ipartite even uniform hypergraphs. Linear Algebra and Its Applications , 480:93–106, 2015

    2015

  75. [81]

    Y.-Z. Fan. The multiplicity of eigenvalues of nonnegat ive weakly irreducible tensors and uniform hypergraphs. arXiv preprint arXiv:2410.20830 , 2024

    2024 arXiv

  76. [82]

    Y.-Z. Fan, T. Huang, and Y.-H. Bao. The dimension of eige nvariety of non- negative tensors associated with spectral radius. Proceedings of the American Mathematical Society, 150(6):2287–2299, 2022

    2022

  77. [83]

    Y.-Z. Fan, T. Huang, Y.-H. Bao, C.-L. Zhuan-Sun, and Y.- P. Li. The spec- tral symmetry of weakly irreducible nonnegative tensors an d connected hy- pergraphs. Transactions of the American Mathematical Society , 372(3):2213– 2233, 2019

    2019

  78. [84]

    Y.-Z. Fan, M. Li, and Y. Wang. The cyclic index of adjacen cy tensor of gen- eralized power hypergraphs. Discrete Mathematics , 344(5):112329, 2021

    2021

  79. [85]

    Fan, Y.-Y

    Y.-Z. Fan, Y.-Y. Tan, X.-X. Peng, and A.-H. Liu. Maximiz ing spectral radii of uniform hypergraphs with few edges. Discussiones Mathematicae Graph Theory, 4(36):845–856, 2016. 44 S. S. Shetty and K. A. Bhat

    2016

  80. [86]

    Fan, M.-Y

    Y.-Z. Fan, M.-Y. Tian, and M. Li. The stabilizing index a nd cyclic index of the coalescence and cartesian product of uniform hypergr aphs. Journal of Combinatorial Theory, Series A , 185:105537, 2022

    2022

  81. [87]

    Y.-Z. Fan, Y. Wang, and Y.-H. Bao. Eigenvectors of z-ten sors associated with least h-eigenvalue with application to hypergraphs. arXiv preprint arXiv:1901.08222, 2019

    1901 arXiv

  82. [88]

    Y.-Z. Fan, Y. Wang, and J.-C. Wan. Minimal non-odd-tran sversal hyper- graphs and minimal non-odd-bipartite hypergraphs. The Electronic Journal of Combinatorics , pages P4–35, 2020

    2020

  83. [89]

    Fan, H.-X

    Y.-Z. Fan, H.-X. Yang, and J. Zheng. High ordered spectr al characterization of unicyclic graphs. Discussiones Mathematicae: Graph Theory , 44(3), 2024

    2024

  84. [90]

    Y.-Z. Fan, Y. Yang, C.-M. She, J. Zheng, Y.-M. Song, and H .-X. Yang. The trace and estrada index of uniform hypergraphs with cut vert ices. Linear Algebra and its Applications , 660:89–117, 2023

    2023

  85. [91]

    Y.-Z. Fan, J. Zheng, and Y. Yang. The trace of uniform hyp ergraphs with application to estrada index. Discrete Mathematics, Algorithms and Applica- tions, 16(05):2350065, 2024

    2024

  86. [92]

    X. Fang, Y. Huang, and L. You. Some bounds on the spectral radius of uniform hypergraphs. Frontiers of Mathematics , 18(5):1211–1228, 2023

    2023

  87. [93]

    Farrugia

    A. Farrugia. Graphs having most of their eigenvalues sh ared by a vertex deleted subgraph. Symmetry, 13(9):1663, 2021

    2021

  88. [94]

    Feng et al

    K. Feng et al. Spectra of hypergraphs and applications. Journal of number theory, 60(1):1–22, 1996

    1996

  89. [95]

    Friedland, S

    S. Friedland, S. Gaubert, and L. Han. Perron–frobenius theorem for nonneg- ative multilinear forms and extensions. Linear Algebra and its Applications , 438(2):738–749, 2013

    2013

  90. [96]

    Friedman and A

    J. Friedman and A. Wigderson. On the second eigenvalue o f hypergraphs. Combinatorica, 15(1):43–65, 1995

    1995

  91. [97]

    Fu and Y

    Y. Fu and Y. Gao. Incidence energy of k-uniform hypertre es. MATCH Com- mun. Math. Comput. Chem , 92:133–150, 2024

    2024

  92. [98]

    Galuppi, R

    F. Galuppi, R. Mulas, and L. Venturello. Spectral theor y of weighted hyper- graphs via tensors. Linear and Multilinear Algebra , 71(3):317–347, 2023

    2023

  93. [99]

    G. Gao, A. Chang, and Y. Hou. Spectral radius on linear r- graphs without expanded k r+1. SIAM Journal on Discrete Mathematics , 36(2):1000–1011, 2022

    2022

  94. [100]

    I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky. Discriminants, Resul- tants, and Multidimensional Determinants . Birkh¨ auser, Boston, MA, 1994

    1994

  95. [101]

    Grenet, P

    B. Grenet, P. Koiran, and N. Portier. The multivariate resultant is np-hard in any characteristic. In International Symposium on Mathematical Foundations of Computer Science , pages 477–488. Springer, 2010

    2010

  96. [102]

    Guo and B

    H. Guo and B. Zhou. On the spectral radius of uniform hyp ertrees. Linear Algebra and its Applications , 558:236–249, 2018

    2018

  97. [103]

    Guo and B

    H. Guo and B. Zhou. On the α-spectral radius of uniform hypergraphs. Dis- cussiones Mathematicae Graph Theory , 40(2):559–575, 2020

    2020

  98. [104]

    I. Gutman. The energy of a graph. Ber. Math. Stat. Sekt. Forschungsz. Graz , 103:1–22, 1978. Spectral Theory of Hypergraphs 45

    1978

  99. [105]

    I. Gutman. The energy of a graph: old and new results. In Algebraic Combi- natorics and Applications: Proceedings of the Euroconfere nce, Algebraic Com- binatorics and Applications (ALCOMA- 1999) , pages 196–211, G¨ oßweinstein, Germany, 2001. Springer

    1999

  100. [106]

    Gutman and B

    I. Gutman and B. Furtula. Survey of graph energies. Mathematics Interdisci- plinary Research, 2(2):85–129, 2017

    2017

  101. [107]

    S. L. Hakimi. Steiner’s problem in graphs and its impli cations. Networks, 1(2):113–133, 1971

    1971

  102. [108]

    F. Harary. The determinant of the adjacency matrix of a graph. Siam Review, 4(3):202–210, 1962

    1962

  103. [109]

    C. J. Hillar and L.-H. Lim. Most tensor problems are np- hard. Journal of the ACM (JACM) , 60(6):1–39, 2013

    2013

  104. [110]

    Hofmeister

    M. Hofmeister. On the two largest eigenvalues of trees . Linear algebra and its applications, 260:43–59, 1997

    1997

  105. [111]

    R. A. Horn and C. R. Johnson. Matrix analysis . Cambridge university press, Cambridge, 2012

    2012

  106. [113]

    Y. Hou, A. Chang, and C. Shi. On the α-spectra of uniform hypergraphs and its associated graphs. Acta Mathematica Sinica, English Series , 36(7):842– 850, 2020

    2020

  107. [114]

    Y. Hou, A. Chang, and L. Zhang. A homogeneous polynomia l associated with general hypergraphs and its applications. Linear Algebra and its Applications , 591:72–86, 2020

    2020

  108. [115]

    S. Hu. Symmetry of eigenvalues of sylvester matrices a nd tensors. Science China Mathematics , 63(5):845–872, 2020

    2020

  109. [116]

    Hu, Z.-H

    S. Hu, Z.-H. Huang, C. Ling, and L. Qi. On determinants a nd eigenvalue theory of tensors. Journal of Symbolic Computation , 50:508–531, 2013

    2013

  110. [117]

    Hu and L

    S. Hu and L. Qi. The eigenvectors associated with the ze ro eigenvalues of the laplacian and signless laplacian tensors of a uniform hy pergraph. Discrete Applied Mathematics, 169:140–151, 2014

    2014

  111. [118]

    Hu and L

    S. Hu and L. Qi. The laplacian of a uniform hypergraph. Journal of Combi- natorial Optimization , 29(2):331–366, 2015

    2015

  112. [119]

    S. Hu, L. Qi, and J.-Y. Shao. Cored hypergraphs, power h ypergraphs and their laplacian h-eigenvalues. Linear Algebra and Its Applications , 439(10):2980– 2998, 2013

    2013

  113. [120]

    S. Hu, L. Qi, and J. Xie. The largest laplacian and signl ess laplacian h- eigenvalues of a uniform hypergraph. Linear Algebra and its Applications , 469:1–27, 2015

    2015

  114. [121]

    Hu and K

    S. Hu and K. Ye. Multiplicities of tensor eigenvalues. Communications in Mathematical Sciences, 14(4):1049–1071, 2016

    2016

  115. [122]

    Y.-L. Jin, J. Zhang, and X.-D. Zhang. Equitable partit ion theorem of ten- sors and spectrum of generalized power hypergraphs. Linear Algebra and its Applications, 555:21–38, 2018

    2018

  116. [123]

    L. Kang, L. Liu, L. Qi, and X. Yuan. Spectral radii of two kinds of uniform hypergraphs. Applied Mathematics and Computation , 338:661–668, 2018. 46 S. S. Shetty and K. A. Bhat

    2018

  117. [124]

    L. Kang, L. Liu, and E. Shan. Sharp lower bounds on the sp ectral radius of uniform hypergraphs concerning degrees. The Electronic Journal of Combi- natorics, 25(2):2–1, 2018

    2018

  118. [125]

    L. Kang, L. Liu, and E. Shan. The eigenvectors to the p-spectral radius of gen- eral hypergraphs. Journal of Combinatorial Optimization , 38:556–569, 2019

    2019

  119. [126]

    Kang and V

    L. Kang and V. Nikiforov. Extremal problems for the p-spectral radius of graphs. The Electronic Journal of Combinatorics , 21(3):P3–21, 2014

    2014

  120. [127]

    L. Kang, V. Nikiforov, and X. Yuan. The p-spectral radi us of k-partite and k- chromatic uniform hypergraphs. Linear Algebra and its Applications , 478:81– 107, 2015

    2015

  121. [128]

    L. Kang, W. Zhang, and E. Shan. The spectral radius and d omination num- ber of uniform hypergraphs. In International Conference on Combinatorial Optimization and Applications , pages 306–316, 2017

    2017

  122. [129]

    L. Kang, W. Zhang, and E. Shan. The spectral radius and d omination num- ber in linear uniform hypergraphs. Journal of Combinatorial Optimization , 42(3):581–592, 2021

    2021

  123. [130]

    Keevash, J

    P. Keevash, J. Lenz, and D. Mubayi. Spectral extremal p roblems for hyper- graphs. SIAM Journal on Discrete Mathematics , 28(4):1838–1854, 2014

    2014

  124. [131]

    Keevash and R

    P. Keevash and R. Mycroft. A geometric theory for hypergraph matching , volume 233. American Mathematical Society, Charles Street Providence, 2015

    2015

  125. [132]

    P. J. Kelly. A congruence theorem for trees. Pacific Journal of Mathematics , 7(1):961–968, 1957

    1957

  126. [133]

    F. H. Kenter. Necessary spectral conditions for color ing hypergraphs. arXiv preprint arXiv:1412.3855 , 2014

    2014 arXiv

  127. [134]

    Khan, Y.-Z

    M.-u.-I. Khan, Y.-Z. Fan, and Y.-Y. Tan. The h-spectra of a class of general- ized power hypergraphs. Discrete Mathematics , 339(6):1682–1689, 2016

    2016

  128. [135]

    Kivel¨ a, A

    M. Kivel¨ a, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. A. Porter. Multilayer networks. Journal of complex networks , 2(3):203–271, 2014

    2014

  129. [136]

    W. L. Kocay. A family of nonreconstructible hypergrap hs. Journal of Combi- natorial Theory, Series B , 42(1):46–63, 1987

    1987

  130. [137]

    Kofidis and P

    E. Kofidis and P. A. Regalia. On the best rank-1 approxim ation of higher- order supersymmetric tensors. SIAM Journal on Matrix Analysis and Appli- cations, 23(3):863–884, 2002

    2002

  131. [138]

    E. V. Konstantinova and V. A. Skorobogatov. Applicati on of hypergraph theory in chemistry. Discrete Mathematics , 235(1-3):365–383, 2001

    2001

  132. [139]

    Kuo, W.-W

    Y.-C. Kuo, W.-W. Lin, and C.-S. Liu. Continuation meth ods for computing z-/h-eigenpairs of nonnegative tensors. Journal of Computational and Applied Mathematics, 340:71–88, 2018

    2018

  133. [140]

    L. J. Kurian and C. Velu. Bounds for the energy of hyperg raphs. Axioms, 13(11):804, 2024

    2024

  134. [141]

    S. Lato. A spectral moore bound for bipartite semiregu lar graphs. SIAM Jour- nal on Discrete Mathematics , 37(1):315–331, 2023

    2023

  135. [142]

    Lenz and D

    J. Lenz and D. Mubayi. Eigenvalues and linear quasiran dom hypergraphs. In Forum of Mathematics, Sigma , volume 3, page e2. Cambridge University Press, 2015. Spectral Theory of Hypergraphs 47

    2015

  136. [143]

    Li, J.-Y

    H. Li, J.-Y. Shao, and L. Qi. The extremal spectral radi i of k-uniform su- pertrees. Journal of Combinatorial Optimization , 32(3):741–764, 2016

    2016

  137. [144]

    H. Li, L. Su, and S. Fallat. On a relationship between th e characteristic and matching polynomials of a uniform hypertree. Discrete Mathematics , 347(5):113915, 2024

    2024

  138. [145]

    H. Li, J. Zhou, and C. Bu. Principal eigenvectors and sp ectral radii of uniform hypergraphs. Linear Algebra and its Applications , 544:273–285, 2018

    2018

  139. [146]

    Li and B

    H.-H. Li and B. Mohar. On the first and second eigenvalue of finite and infi- nite uniform hypergraphs. Proceedings of the American Mathematical Society , 147(3):933–946, 2019

    2019

  140. [147]

    Li and X

    S. Li and X. Li. Influence maximization in hypergraphs: A self-optimizing algorithm based on electrostatic field. Chaos, Solitons & Fractals , 174:113888, 2023

    2023

  141. [148]

    Li and A

    W. Li and A. Chang. The effect on the spectral radius of r- graphs by grafting or contracting edges. Linear Algebra and its Applications , 597:1–17, 2020

    2020

  142. [149]

    Li and L

    W. Li and L. Liu. The α-normal labeling for generalized directed uniform hypergraphs. Linear Algebra and its Applications , 611:365–388, 2021

    2021

  143. [150]

    X. Li, Y. Shi, and I. Gutman. Graph energy . Springer Science & Business Media, Spring Street, New York, 2012

    2012

  144. [151]

    Lia and C

    H. Lia and C. Dengb. On the principal eigenvectors of ge neral hypergraphs. ScienceAsia, 50(2), 2024

    2024

  145. [152]

    L.-H. Lim. Singular values and eigenvalues of tensors : a variational approach. In 1st IEEE International Workshop on Computational Advances in Multi- Sensor Adaptive Processing, 2005. , pages 129–132, Puerto Vallarta, Mexico,

    2005

  146. [153]

    L.-H. Lim. Tensors in computations. Acta Numerica, 30:555–764, 2021

    2021

  147. [154]

    H. Lin, H. Guo, and B. Zhou. On the α-spectral radius of irregular uniform hypergraphs. Linear and Multilinear Algebra , 68(2):265–277, 2020

    2020

  148. [155]

    H. Lin, B. Mo, B. Zhou, and W. Weng. Sharp bounds for ordi nary and signless laplacian spectral radii of uniform hypergraphs. Applied Mathematics and Computation, 285:217–227, 2016

    2016

  149. [156]

    H. Lin, G. Yu, and B. Zhou. On the irregularity of unifor m hypergraphs. Linear Algebra and its Applications , 678:107–124, 2023

    2023

  150. [157]

    H. Lin, L. Zheng, and B. Zhou. Largest and least h-eigen values of symmetric tensors and hypergraphs. arXiv preprint arXiv:2306.14244 , 2023

    2023 arXiv

  151. [158]

    Lin and B

    H. Lin and B. Zhou. Spectral radius of uniform hypergra phs. Linear Algebra and its Applications , 527:32–52, 2017

    2017

  152. [159]

    Lin and B

    H. Lin and B. Zhou. The α-spectral radius of general hypergraphs. Applied Mathematics and Computation , 386:125449, 2020

    2020

  153. [160]

    Lin and B

    H. Lin and B. Zhou. On abc spectral radius of uniform hyp ergraphs. Journal of Combinatorial Optimization , 47(5):85, 2024

    2024

  154. [161]

    H. Lin, B. Zhou, and B. Mo. Upper bounds for H-and Z-spec tral radii of uniform hypergraphs. Linear Algebra and Its Applications , 510:205–221, 2016

    2016

  155. [162]

    Lin and X

    W. Lin and X. Guo. Ordering trees by their largest eigen values. Linear algebra and its applications , 418(2-3):450–456, 2006. 48 S. S. Shetty and K. A. Bhat

    2006

  156. [163]

    C. Liu, J. Zhou, and C. Bu. An erd \h {o} s-stone type result for high-order spectra of graphs. arXiv preprint arXiv:2311.13368 , 2023

    2023 arXiv

  157. [164]

    C. Liu, J. Zhou, and C. Bu. The high order spectrum of a gr aph and its applications in graph colouring and clique counting. Linear and Multilinear Algebra, 71(14):2354–2365, 2023

    2023

  158. [165]

    C. Liu, J. Zhou, and C. Bu. The high order spectral extre mal results for graphs and their applications. Discrete Applied Mathematics , 357:209–214, 2024

    2024

  159. [166]

    C.-S. Liu. Exact and inexact iterative methods for find ing the largest eigenpair of a weakly irreducible nonnegative tensor. Journal of Scientific Computing , 91(3):78, 2022

    2022

  160. [167]

    L. Liu, L. Kang, and S. Bai. Bounds on the spectral radiu s of uniform hyper- graphs. Discrete Applied Mathematics , 259:160–169, 2019

    2019

  161. [168]

    L. Liu, L. Kang, and E. Shan. On the irregularity of unif orm hypergraphs. European Journal of Combinatorics , 71:22–32, 2018

    2018

  162. [169]

    L. Liu, L. Kang, and X. Yuan. On the principal eigenvect ors of uniform hy- pergraphs. Linear Algebra and its Applications , 511:430–446, 2016

    2016

  163. [170]

    Liu and L

    L. Liu and L. Lu. The ( p, q)-spectral radii of ( r, s)-directed hypergraphs. arXiv preprint arXiv:1804.08808 , 2018

    2018 arXiv

  164. [171]

    Liu and L

    L. Liu and L. Lu. The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs. Linear and Multilinear Algebra , 70(9):1648– 1672, 2022

    2022

  165. [172]

    L. Liu, Z. Ni, J. Wang, and L. Kang. Hypergraph extensio ns of spectral Tur´ an theorem. arXiv preprint arXiv:2408.03122 , 2024

    2024 arXiv

  166. [173]

    L. Lu. The maximum p-spectral radius of hypergraphs with m edges. arXiv preprint arXiv:1803.08653 , 2018

    2018 arXiv

  167. [174]

    Lu and S

    L. Lu and S. Man. Connected hypergraphs with small spec tral radius. Linear Algebra and its Applications , 509:206–227, 2016

    2016

  168. [175]

    Lu and X

    L. Lu and X. Peng. High-order random walks and generali zed laplacians on hypergraphs. Internet Mathematics , 9(1):3–32, 2013

    2013

  169. [176]

    Lugo-Martinez, D

    J. Lugo-Martinez, D. Zeiberg, T. Gaudelet, N. Malod-D ognin, N. Przulj, and P. Radivojac. Classification in biological networks with hy pergraphlet kernels. Bioinformatics, 37(7):1000–1007, 2021

    2021

  170. [177]

    C. Lv, L. You, and Y. Huang. A general result on the spect ral radii of non- negative k-uniform tensors. AIMS Mathematics , 5(3):1799–1819, 2020

    2020

  171. [178]

    C. Lv, L. You, and X.-D. Zhang. A sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and its applications to (dir ected) hypergraphs. Journal of Inequalities and Applications , 2020:1–16, 2020

    2020

  172. [179]

    L. A. Lyusternik and L. G. Shnirel’man. Topological me thods in variational problems and their application to the differential geometry of surfaces. Uspekhi Matematicheskikh Nauk , 2(1):166–217, 1947

    1947

  173. [180]

    W. Ma, W. Ding, and Y. Wei. Noda iteration for computing generalized tensor eigenpairs. Journal of Computational and Applied Mathematics , 432:115284, 2023

    2023

  174. [181]

    Mann and V

    V. Mann and V. Venkatasubramanian. Ai-driven hypergr aph network of or- ganic chemistry: network statistics and applications in re action classification. Reaction Chemistry & Engineering , 8(3):619–635, 2023. Spectral Theory of Hypergraphs 49

    2023

  175. [182]

    A. J. McConnell. Applications of tensor analysis . Dover Publications, Garden city, New York, 2014

    2014

  176. [183]

    Meenakshi and O

    A. Meenakshi and O. Mythreyi. Mathematical modeling o f social networks using hypergraphs. In 2023 First International Conference on Advances in Electrical, Electronics and Computational Intelligence ( ICAEECI), pages 1–

    2023

  177. [184]

    Morozov and S

    A. Morozov and S. Shakirov. Analogue of the identity lo g det= trace log for resultants. Journal of Geometry and Physics , 61(3):708–726, 2011

    2011

  178. [185]

    Morozov and S

    A. Morozov and S. Shakirov. Resultants and contour int egrals. Functional Analysis and Its Applications , 46(1):33–40, 2012

    2012

  179. [186]

    A. Y. Morozov and S. R. Shakirov. New and old results in r esultant theory. Theoretical and Mathematical Physics , 163:587–617, 2010

    2010

  180. [187]

    Mowshowitz

    A. Mowshowitz. The characteristic polynomial of a gra ph. Journal of Combi- natorial Theory, Series B , 12(2):177–193, 1972

    1972

  181. [188]

    Mukhopadhyay, M

    S. Mukhopadhyay, M. Palakal, and K. Maddu. Multi-way a ssociation extrac- tion and visualization from biological text documents usin g hyper-graphs: applications to genetic association studies for diseases. Artificial intelligence in medicine , 49(3):145–154, 2010

    2010

  182. [189]

    Z. Ni, L. Liu, and L. Kang. Spectral tur´ an-type proble ms on cancellative hypergraphs. The Electronic Journal of Combinatorics , 31(2):P2–32, 2024

    2024

  183. [190]

    Nie and X

    J. Nie and X. Zhang. Real eigenvalues of nonsymmetric t ensors. Computa- tional Optimization and Applications , 70(1):1–32, 2018

    2018

  184. [191]

    Nikiforov

    V. Nikiforov. Some new results in extremal graph theor y. Surveys in Combi- natorics, pages 141–181, 2011

    2011

  185. [192]

    Nikiforov

    V. Nikiforov. Analytic methods for uniform hypergrap hs. Linear Algebra and its Applications , 457:455–535, 2014

    2014

  186. [193]

    Nikiforov

    V. Nikiforov. Combinatorial methods for the spectral p-norm of hypermatri- ces. Linear Algebra and its Applications , 529:324–354, 2017

    2017

  187. [194]

    Nikiforov

    V. Nikiforov. Hypergraphs and hypermatrices with sym metric spectrum. Lin- ear Algebra and its Applications , 519:1–18, 2017

    2017

  188. [195]

    Nikiforov

    V. Nikiforov. Hoffman’s bound for hypergraphs. arXiv preprint arXiv:1908.01433, 2019

    1908 arXiv

  189. [196]

    A. Nilli. On the second eigenvalue of a graph. Discrete Mathematics , 91(2):207–210, 1991

    1991

  190. [197]

    Q. Niu, H. Ren, and L. Zhang. Sharp bounds on the spectra l radii of uniform hypergraphs concerning diameter or clique number. Discrete Dynamics in Nature and Society , 2021(1):5805239, 2021

    2021

  191. [198]

    Ouvrard, J.-M

    X. Ouvrard, J.-M. L. Goff, and S. Marchand-Maillet. Adj acency and tensor representation in general hypergraphs part 1: e-adjacency tensor uniformisa- tion using homogeneous polynomials. arXiv preprint arXiv:1712.08189 , 2017

    2017 arXiv

  192. [199]

    Ouyang, L

    C. Ouyang, L. Qi, and X. Yuan. The first few unicyclic and bicyclic hy- pergraphs with largest spectral radii. Linear Algebra and its Applications , 527:141–162, 2017

    2017

  193. [200]

    Pearson and T

    K. Pearson and T. Zhang. Eigenvalues on the adjacency t ensor of products of hypergraphs. Int. J. Contemp. Math. Sci , 8(4):151–158, 2013. 50 S. S. Shetty and K. A. Bhat

    2013

  194. [201]

    K. J. Pearson. Spectral hypergraph theory of the adjac ency hypermatrix and matroids. Linear Algebra and its Applications , 465:176–187, 2015

    2015

  195. [202]

    K. J. Pearson and T. Zhang. On spectral hypergraph theo ry of the adjacency tensor. Graphs and Combinatorics , 30:1233–1248, 2014

    2014

  196. [203]

    Petersdorf and H

    M. Petersdorf and H. Sachs. ¨Uber spektrum, automorphismengruppe und teiler eines graphen. Wiss. Z. Techn. Hochsch. Ilmenau , 15:123–128, 1969

    1969

  197. [204]

    I. Pitas. Graph-based social media analysis . CRC Press, New York, 2016

    2016

  198. [205]

    L. L. Portugal, R. D. Vecchio, and S. Dantas. Relating h ypergraph parameters of generalized power graphs. Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 Proceedings , pages 117–129, 2021

    2021

  199. [206]

    L. Qi. Eigenvalues of a real supersymmetric tensor. Journal of symbolic com- putation, 40(6):1302–1324, 2005

    2005

  200. [207]

    L. Qi. h+-eigenvalues of laplacian and signless laplacian tensors. arXiv preprint arXiv:1303.2186 , 2013

    2013 arXiv

  201. [208]

    L. Qi. Symmetric nonnegative tensors and copositive t ensors. Linear Algebra and its Applications , 439(1):228–238, 2013

    2013

  202. [209]

    Qi and Z

    L. Qi and Z. Luo. Tensor analysis: spectral theory and special tensors . SIAM, Philadelphia,USA, 2017

    2017

  203. [210]

    Rajesh Kannan, N

    M. Rajesh Kannan, N. Shaked-Monderer, and A. Berman. O n weakly irre- ducible nonnegative tensors and interval hull of some class es of tensors. Linear and Multilinear Algebra , 64(4):667–679, 2016

    2016

  204. [211]

    R¨ aty and I

    E. R¨ aty and I. Tomon. Bisection width, discrepancy, a nd eigenvalues of hy- pergraphs. arXiv preprint arXiv:2409.15140 , 2024

    2024 arXiv

  205. [212]

    N. Reff. Spectral properties of oriented hypergraphs. The Electronic Journal of Linear Algebra , 27:373–391, 2014

    2014

  206. [213]

    Rodriguez

    J. Rodriguez. Laplacian eigenvalues and partition pr oblems in hypergraphs. Applied Mathematics Letters , 22(6):916–921, 2009

    2009

  207. [214]

    Rota Bul` o and M

    S. Rota Bul` o and M. Pelillo. New bounds on the clique number of graphs based on spectral hypergraph theory. In International Conference on Learning and Intelligent Optimization , pages 45–58. Springer, 2009

    2009

  208. [215]

    Rowlinson

    P. Rowlinson. On the maximal index of graphs with a pres cribed number of edges. Linear Algebra and its Applications , 110:43–53, 1988

    1988

  209. [216]

    H. Sachs. ¨Uber teiler, faktoren und charakteristische polynome von g raphen. Teil I. Wiss. Z. TH Ilmenau , 12:7–12, 1966

    1966

  210. [217]

    M. T. Schaub, Y. Zhu, J.-B. Seby, T. M. Roddenberry, and S. Segarra. Signal processing on higher-order networks: Livin’on the edge... and beyond. Signal Processing, 187:108149, 2021

    2021

  211. [218]

    A. J. Schwenk. Almost all trees are cospectral. New directions in the theory of graphs, pages 275–307, 1973

    1973

  212. [219]

    A. J. Schwenk. Spectral reconstruction problems. Annals of the New York Academy of Sciences , 328(1):183–189, 1979

    1979

  213. [220]

    Sciriha and Z

    I. Sciriha and Z. Stani´ c. The polynomial reconstruct ion problem: The first 50 years. Discrete Mathematics , 346(6):113349, 2023

    2023

  214. [221]

    H. Shan, Z. Wang, and F. Wang. The smallest spectral rad ius of bicyclic uniform hypergraphs with a given size. Linear Algebra and its Applications , 622:166–188, 2021. Spectral Theory of Hypergraphs 51

    2021

  215. [222]

    J.-Y. Shao. A general product of tensors with applicat ions. Linear Algebra and its applications , 439(8):2350–2366, 2013

    2013

  216. [223]

    J.-Y. Shao, L. Qi, and S. Hu. Some new trace formulas of t ensors with applications in spectral hypergraph theory. Linear and Multilinear Algebra , 63(5):971–992, 2015

    2015

  217. [224]

    Shao, H.-Y

    J.-Y. Shao, H.-Y. Shan, and B.-f. Wu. Some spectral pro perties and charac- terizations of connected odd-bipartite uniform hypergrap hs. Linear and Mul- tilinear Algebra, 63(12):2359–2372, 2015

    2015

  218. [225]

    Shao, H.-Y

    J.-Y. Shao, H.-Y. Shan, and L. Zhang. On some propertie s of the determinants of tensors. Linear Algebra and its applications , 439(10):3057–3069, 2013

    2013

  219. [227]

    She, Y.-Z

    C.-M. She, Y.-Z. Fan, L. Kang, and Y. Hou. Linear spectr al Tur´ an prob- lems for expansions of graphs with given chromatic number. arXiv preprint arXiv:2211.13647, 2022

    2022 arXiv

  220. [228]

    Sheng, Q

    Z. Sheng, Q. Ni, and G. Yuan. Local convergence analysi s of inverse iteration algorithm for computing the h-spectral radius of a nonnegat ive weakly irre- ducible tensor. Journal of Computational and Applied Mathematics , 357:26– 37, 2019

    2019

  221. [229]

    Shirdel, A

    G. Shirdel, A. Mortezaee, and E. Golpar-Raboky. On spe ctral theory of a k- uniform directed hypergraph. Applicable Analysis and Discrete Mathematics , 17(2):296–320, 2023

    2023

  222. [230]

    G. H. Shirdel, A. Mortezaee, and E. Golpar-raboky. Non -uniform hyper- graphs. Iranian Journal of Mathematical Chemistry , 11(3):161–177, 2020

    2020

  223. [231]

    Si and X

    X. Si and X. Yuan. On the spectral radii and principal ei genvectors of uniform hypergraphs. Discrete Mathematics, Algorithms and Applications , 9(04):1750048, 2017

    2017

  224. [232]

    J. H. Smith. Some properties of the spectrum of a graph. In Combinatorial Structures and their applications , pages 403–406. Gordon and Breach New York, 1970

    1970

  225. [233]

    Song, Y.-Z

    Y.-M. Song, Y.-Z. Fan, and Z. Miao. Hypergraph coverin gs and ramanujan hypergraphs. arXiv preprint arXiv:2310.01771 , 2023

    2023 arXiv

  226. [234]

    Song, Y.-Z

    Y.-M. Song, Y.-Z. Fan, Y. Wang, M.-Y. Tian, and J.-C. Wa n. The spectral property of hypergraph coverings. Discrete Mathematics, 347(3):113830, 2024

    2024

  227. [235]

    Sripaisan and Y

    N. Sripaisan and Y. Meemark. Algebraic degree of spect ra of cayley hyper- graphs. Discrete Applied Mathematics , 316:87–94, 2022

    2022

  228. [236]

    L. Su, L. Kang, H. Li, and E. Shan. The matching polynomi als and spectral radii of uniform supertrees. The Electronic Journal of Combinatorics , 25(4):4– 13, 2018

    2018

  229. [237]

    L. Su, L. Kang, H. Li, and E. Shan. The largest spectral r adius of uniform hypertrees with a given size of matching. Linear and Multilinear Algebra , 68(9):1779–1791, 2020

    2020

  230. [238]

    L. Su, L. Kang, H. Li, and E. Shan. The second largest spe ctral radii of uni- form hypertrees with given size of matching. Linear and Multilinear Algebra , 69(14):2674–2701, 2021. 52 S. S. Shetty and K. A. Bhat

    2021

  231. [239]

    Su and H

    L. Su and H. Li. The hypertree with the largest spectral radius among all hypertrees with given size and stability number. Frontiers of Mathematics , 18(3):697–705, 2023

    2023

  232. [240]

    L. Sun, J. Zhou, and C. Bu. Spectral properties of gener al hypergraphs. Linear Algebra and its Applications , 561:187–203, 2019

    2019

  233. [241]

    Sun and W.-H

    R. Sun and W.-H. Wang. On the spectral radius of uniform weighted hyper- graph. Discrete Mathematics, Algorithms and Applications , 15(01):2250067, 2023

    2023

  234. [242]

    Suna, W.-H

    R. Suna, W.-H. Wanga, and Z.-Y. Nia. The maximal spectr al radius of the uniform unicyclic hypergraphs with perfect matchings. Filomat, 37(18):5949– 5967, 2023

    2023

  235. [243]

    J. J. Sylvester. A method of determining by mere inspec tion the derivatives from two equations of any degree. The London, Edinburgh, and Dublin Philo- sophical Magazine and Journal of Science , 16(101):132–135, 1840

  236. [244]

    A. A. Taranenko. Perfect colourings of hypergraphs. Linear and Multilinear Algebra, pages 1–25, 2024

    2024

  237. [245]

    G. A. Tauscheck. Generalizations of the Graham-Pollak Tree Theorem . PhD thesis, College of Arts and Sciences University of South Car olina, 2024

    2024

  238. [246]

    W. T. Tutte. All the king’s horses. a guide to reconstru ction. In Graph theory and related topics , pages 15–33. Academic Press New York, 1979

    1979

  239. [247]

    S. M. Ulam. A collection of mathematical problems. Interscience Tracts in Pure and Applied Mathematics , 8, 1960

    1960

  240. [248]

    van Aardenne-Ehrenfest and N

    T. van Aardenne-Ehrenfest and N. G. de Bruijn. Circuit s and trees in oriented linear graphs. Classic papers in combinatorics , pages 149–163, 1987

    1987

  241. [249]

    E. R. Van Dam and W. H. Haemers. Which graphs are determi ned by their spectrum? Linear Algebra and its applications , 373:241–272, 2003

    2003

  242. [250]

    E. R. Van Dam and W. H. Haemers. Developments on spectra l characteriza- tions of graphs. Discrete Mathematics , 309(3):576–586, 2009

    2009

  243. [251]

    O. Veblen. An application of modular equations in anal ysis situs. Annals of Mathematics, 14(1/4):86–94, 1912

    1912

  244. [252]

    Vishnupriya and R

    R. Vishnupriya and R. Rajkumar. Tensor join of hypergr aphs and its spectra. arXiv preprint arXiv:2206.02408 , 2022

    2022 arXiv

  245. [253]

    J.-C. Wan, Y. Wang, and Y.-z. Fan. Distribution of zero s of matching poly- nomials of hypergraphs. arXiv preprint arXiv:2206.09558 , 2022

    2022 arXiv

  246. [254]

    J.-C. Wan, Y. Wang, and F.-T. Hu. Spectra of weighted un iform hypertrees. The Electronic Journal of Combinatorics , 29(2):P2–40, 2022

    2022

  247. [255]

    F. Wang, H. Shan, and Z. Wang. On some properties of the α-spectral radius of the k-uniform hypergraph. Linear Algebra and Its Applications , 589:62–79, 2020

    2020

  248. [256]

    W.-H. Wang. The minimum spectral radius of the r-unifo rm supertree having two vertices of maximum degree. Linear and Multilinear Algebra, 70(15):2898– 2918, 2022

    2022

  249. [257]

    Wang and L

    W.-H. Wang and L. Yuan. Uniform supertrees with extrem al spectral radii. Frontiers of Mathematics in China , 15:1211–1229, 2020. Spectral Theory of Hypergraphs 53

    2020

  250. [258]

    Y. Wang, W. Le, and Y.-Z. Fan. A spectral method to incid ence balance of oriented hypergraphs and induced signed hypergraphs. Linear and Multilinear Algebra, 70(19):4804–4818, 2022

    2022

  251. [259]

    Wu, J.-Y

    X.-L. Wu, J.-Y. Yuan, and L.-B. Cui. A characterizatio n of irreducible tensors by using the connectedness of the associated directed hyper graphs. Discrete and Continuous Dynamical Systems-S , 18(3):791–805, 2025

    2025

  252. [260]

    Xiao and L

    P. Xiao and L. Wang. The maximum spectral radius of unif orm hyper- graphs with given number of pendant edges. Linear and Multilinear Algebra , 67(7):1392–1403, 2019

    2019

  253. [261]

    Xiao and L

    P. Xiao and L. Wang. The effect on the (signless laplacia n) spectral radii of uniform hypergraphs by subdividing an edge. Discrete Applied Mathematics , 283:444–455, 2020

    2020

  254. [262]

    Xiao and L

    P. Xiao and L. Wang. The effect on the adjacency and signl ess laplacian spectral radii of uniform hypergraphs by grafting edges. Linear Algebra and its Applications , 610:591–607, 2021

    2021

  255. [263]

    P. Xiao, L. Wang, and Y. Du. The first two largest spectra l radii of uniform supertrees with given diameter. Linear Algebra and its Applications , 536:103– 119, 2018

    2018

  256. [264]

    P. Xiao, L. Wang, and Y. Lu. The maximum spectral radii o f uniform su- pertrees with given degree sequences. Linear Algebra and its Applications , 523:33–45, 2017

    2017

  257. [265]

    Xie and L

    J. Xie and L. Qi. Spectral directed hypergraph theory v ia tensors. Linear and Multilinear Algebra, 64(4):780–794, 2016

    2016

  258. [266]

    G. Xu. On the spectral radius of trees with perfect matc hings. In Combina- torics and Graph Theory . World Scientific, Singapore, 1997

    1997

  259. [267]

    Xu, F.-T

    S.-H. Xu, F.-T. Hu, and Y. Wang. On extremal spectral ra dius of blow-up uniform hypergraphs. Linear Algebra and its Applications , 667:71–87, 2023

    2023

  260. [268]

    Yang and Q

    Y. Yang and Q. Yang. Further results for perron–froben ius theorem for nonnegative tensors. SIAM Journal on Matrix Analysis and Applications , 31(5):2517–2530, 2010

    2010

  261. [269]

    Yang and Q

    Y. Yang and Q. Yang. On some properties of nonnegative w eakly irreducible tensors. arXiv preprint arXiv:1111.0713 , 2011

    2011 arXiv

  262. [270]

    L. You, X. Huang, and X. Yuan. Sharp bounds for spectral radius of nonneg- ative weakly irreducible tensors. Frontiers of Mathematics in China , 14:989– 1015, 2019

    2019

  263. [271]

    G. Yu, C. Yan, L. Sun, Y. Wu, and H. Zhang. Spectral radiu s and match- ing number of the unicyclic hypergraph. Linear Algebra and its Applications , 610:571–590, 2021

    2021

  264. [272]

    G. Yu, X. Yuan, and H. Qu. Signed k-uniform hypergraphs and tensors. Linear Algebra and its Applications , 580:1–13, 2019

    2019

  265. [273]

    X. Yuan, L. Qi, J. Shao, and C. Ouyang. Some properties a nd applications of odd-colorable r-hypergraphs. Discrete Applied Mathematics , 236:446–452, 2018

    2018

  266. [274]

    X. Yuan, J. Shao, and H. Shan. Ordering of some uniform s upertrees with larger spectral radii. Linear Algebra and Its Applications , 495:206–222, 2016

    2016

  267. [275]

    X. Yuan, X. Si, and L. Zhang. Ordering uniform supertre es by their spectral radii. Frontiers of Mathematics in China , 12:1393–1408, 2017. 54 S. S. Shetty and K. A. Bhat

    2017

  268. [276]

    X. Yuan, M. Zhang, and M. Lu. Some upper bounds on the eig envalues of uniform hypergraphs. Linear Algebra and its applications , 484:540–549, 2015

    2015

  269. [277]

    J. Yue, L. Zhang, and M. Lu. Largest adjacency, signles s laplacian, and lapla- cian h-eigenvalues of loose paths. Frontiers of Mathematics in China , 11:623– 645, 2016

    2016

  270. [278]

    Yue, L.-P

    J.-J. Yue, L.-P. Zhang, M. Lu, and L.-Q. Qi. The adjacen cy and signless laplacian spectra of cored hypergraphs and power hypergrap hs. Journal of the Operations Research Society of China , 5(1):27–43, 2017

    2017

  271. [279]

    Zhang and J

    J. Zhang and J. Li. The maximum spectral radius of k-uni form hypergraphs with r pendent vertices. Linear and Multilinear Algebra , 67(5):1062–1073, 2019

    2019

  272. [280]

    Zhang, J

    J. Zhang, J. Li, and H. Guo. Uniform hypergraphs with th e first two smallest spectral radii. Linear Algebra and its Applications , 594:71–80, 2020

    2020

  273. [281]

    Zhang and Z

    J. Zhang and Z. Zhu. Some properties of the p-spectral radius on tensors for general hypergraphs and their applications. Opearators and Matrices , 16(3):925–940, 2022

    2022

  274. [282]

    Zhang and A

    L. Zhang and A. Chang. Spectral radius of r-uniform sup ertrees with perfect matchings. Frontiers of Mathematics in China , 13:1489–1499, 2018

    2018

  275. [283]

    Zhang and H

    L. Zhang and H. Ren. On extremal spectral radii of unifo rm supertrees with given independence number. Discrete Dynamics in Nature and Society , 2022(1):3930470, 2022

    2022

  276. [284]

    Zhang and X.-D

    P.-L. Zhang and X.-D. Zhang. The spectral radii of inte rsecting uniform hyper- graphs. Communications on Applied Mathematics and Computation , 3:243– 256, 2021

    2021

  277. [285]

    Zhang, L

    W. Zhang, L. Kang, E. Shan, and Y. Bai. The spectra of uni form hypertrees. Linear Algebra and its Applications , 533:84–94, 2017

    2017

  278. [286]

    Zhang, L

    W. Zhang, L. Liu, L. Kang, and Y. Bai. Some properties of the spectral radius for general hypergraphs. Linear Algebra and its Applications , 513:103–119, 2017

    2017

  279. [287]

    Zhang, X

    Y. Zhang, X. Liu, B. Zhang, and X. Yong. The lollipop gra ph is determined by its q-spectrum. Discrete Mathematics , 309(10):3364–3369, 2009

    2009

  280. [288]

    Zheng, H

    J. Zheng, H. Li, and Y.-z. Fan. Spectral Tur´ an problem for hypergraphs with bipartite or multipartite pattern. arXiv preprint arXiv:2409.17679 , 2024

    2024 arXiv

  281. [289]

    Zheng, Y

    L. Zheng, Y. Zhao, X. Zou, and Z. Zhu. The spectral radii on uniform tricyclic hypergraphs. Operators & Matrices , 18(3), 2024

    2024

  282. [290]

    Y.-N. Zheng. Simplifying the computation of the spect rum of the complete k- uniform hypergraph. Linear Algebra and its Applications , 595:145–156, 2020

    2020

  283. [291]

    Y.-N. Zheng. The characteristic polynomial of the com plete 3-uniform hyper- graph. Linear Algebra and its Applications , 627:275–286, 2021

    2021

  284. [292]

    Y.-N. Zheng. Algebraic and geometric multiplicities for some hypergraphs. Discrete Mathematics , 347(2):113780, 2024

    2024

  285. [293]

    Y.-N. Zheng. The zero eigenvalue of the laplacian tens or of a uniform hyper- graph. Linear and Multilinear Algebra , 72(7):1094–1111, 2024

    2024

  286. [294]

    Y.-N. Zheng. On the hyperdeterminants of steiner dist ance hypermatrices. The Electronic Journal of Combinatorics , pages P2–30, 2025. Spectral Theory of Hypergraphs 55

    2025

  287. [295]

    H. Zhou, L. Sun, and C. Bu. Estrada index and subgraph ce ntrality of hyper- graphs via tensors. Discrete Applied Mathematics , 341:120–129, 2023

    2023

  288. [296]

    J. Zhou, L. Sun, and C. Bu. On the spectral radius of nonr egular uniform hypergraphs. arXiv preprint arXiv:1511.09016 , 2015

    2015 arXiv

  289. [297]

    J. Zhou, L. Sun, W. Wang, and C. Bu. Some spectral proper ties of uniform hypergraphs. The Electronic Journal of Combinatorics , 21(4):P4–24, 2014

    2014

  290. [298]

    J. Zhou, X. Yuan, and F. Chen. A note on stability result s for berge-ks, t hypergraphs. Discrete Applied Mathematics , 363:131–138, 2025

    2025

  291. [299]

    J. Zhou, M. Zhang, Z. Zhu, and X. Yuan. Spectral extrema l problems for nearly k-uniform hypergraphs. Filomat, 38(20):7215–7234, 2024

    2024

  292. [300]

    Zhou and Z

    J. Zhou and Z. Zhu. Some properties on α-least eigenvalue of uniform hy- pergraphs and their applications. Computational and Applied Mathematics , 41(3):94, 2022

    2022

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.