Pith. sign in

REVIEW 4 major objections 4 minor 42 references

The ordering of hypertrees and unicyclic hypergraphs by the traces of $\mathcal{A}_{\alpha}$-tensor

T0 review · 4 major / 4 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 Among k-uniform hypertrees and linear unicyclic hypergraphs, the paper identifies the exact first, second, second-last, and last hypergraphs in the A_alpha-spectral-moment order for every alpha in (0,1): paths and cycles at the front…

desk verdict Useful A_alpha moment formulas, but the ordering theorems are not proven: Theorem 5.3 is false for m=4, and the repeated-transformation arguments don't verify their own hypotheses. read the letter →

arxiv 2507.02650 v1 pith:7YKPARCJ submitted 2025-07-03 math.CO

Jueru Liu , Lizhu Sun , Changjiang Bu This is my paper · ORCID
classification math.CO MSC 05C6515A69
keywords hypergraphspectralmomentsA_alpha-tensortensortraceS_alpha-orderlinearunicyclichypertreeextremalVeblen
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

The paper proves that a one-parameter family of spectral invariants, the $\mathcal{A}_{\alpha}$-tensor moments of $k$-uniform hypergraphs, orders hypertrees and linear unicyclic hypergraphs with fully determined extreme ends. For any $\alpha$ between 0 and 1, the hyperpath $P_m^{(k)}$ is the first hypertree and the hyperstar $S_m^{(k)}$ the last; among linear unicyclic hypergraphs the hypercycle $C_m^{(k)}$ is first and the triangle with all remaining hyperedges hung as pendants, $C_3^{(k)} \odot S_{m-3}^{(k)}$, is last. It also pins down the second and second-last members in both families, and the first/last shapes when girth or diameter is fixed. Because the ordering is strict and the extremal shapes do not depend on $\alpha$, a single combinatorial answer governs the whole range of mixing between degrees and adjacency.

What carries the argument

The load-bearing device is a trace expansion: for a $k$-uniform hypergraph $H$, Theorem 3.1 rewrites $\operatorname{Tr}_d(\mathcal{A}_\alpha(H))$ as a degree-sequence term involving $\sum_i d_i^d$, the ordinary adjacency spectral moment $(1-\alpha)^d \operatorname{Tr}_d(\mathcal{A}(H))$, and correction sums over Veblen infragraphs (connected $k$-uniform, $k$-valent multi-hypergraphs) of $H$. From this, the first $k+2$ moments become explicit functions of degrees, hyperedge counts, and counts of small subhypergraphs. Four monotonicity lemmas then drive the ordering: the $\sigma$-transformation moves all pendant hyperedges from a vertex $u$ to a vertex $v$ when $d_H(u) < d_H(v)+s$, and three path-sliding transformations move an attached hypergraph one hyperedge along a pendant path; each move is shown to send the hypergraph earlier in $S_\alpha$-order. The extremal theorems are obtained by saying that any hypergraph in the family can be reduced to the claimed extremal shape by a sequence of these moves.

What would settle it

Enumerate all $k$-uniform linear unicyclic hypergraphs (or hypertrees) for small parameters, such as $k=3$ and $m=5$, and for $\alpha=1/2$ compute $\operatorname{Tr}_2$ and $\operatorname{Tr}_{k+2}(\mathcal{A}_\alpha(H))$ from the explicit formulas in Theorem 3.3; if any hypergraph beats the claimed first or last hypergraph in the lexicographic order, the characterization fails. A more targeted check is to inspect one of the asserted reduction sequences and verify the hypothesis $d_H(u) < d_H(v)+s$ of Lemma 4.1 at each $\sigma$-transformation, since a single violating step would break the comparison chain.

Watch

Extended reading notes

Core claim

The central claim is that the lexicographic $S_\alpha$-order, defined by comparing the traces $\operatorname{Tr}_d(\mathcal{A}_\alpha(H))$ (the sums of $d$-th powers of the $\mathcal{A}_\alpha$-eigenvalues), has the following ends. In the family of $k$-uniform linear unicyclic hypergraphs with $m$ hyperedges and $k \geq 3$, the hypercycle $C_m^{(k)}$ is the first element, $C_{m-1}^{(k)} \cdot P_1^{(k)}$ the second, $C_{3;m-4,1,0}^{(k)}$ the second last, and $C_3^{(k)} \odot S_{m-3}^{(k)}$ the last; with fixed girth $g$, the first is $C_g^{(k)} \cdot P_{m-g}^{(k)}$ and the last is $C_g^{(k)} \odot S_{m-g}^{(k)}$. In the family of $k$-uniform hypertrees with $m$ hyperedges, the hyperpath $P_m^{(k)}$ is the first, the bifurcated hyperpath $F_{m,k}$ the second, the starlike hypergraph $S_{1,2,1,\ldots,1}^{(k)}$ the second last, and the hyperstar $S_m^{(k)}$ the last; with fixed diameter $d$, the last is the starlike hypergraph $S_{\lfloor d/2 \rfloor, d-\lfloor d/2 \rfloor, 1, \ldots, 1}^{(k)}$. The same characterizations yield the hypergraphs attaining the largest and second-largest $2$-nd order moments and the smallest and second-smallest $(k+2)$-nd order moments in each family.

Load-bearing premise

The argument leans on being able to iterate the local moves on any hypergraph in the family, with the degree inequalities of the monotonicity lemmas satisfied at every step, until the claimed extremal hypergraph is reached.

Editorial extensions

If this is right

  • For every $\alpha \in (0,1)$ and $k \geq 3$, the hypercycle $C_m^{(k)}$ and the hyperpath $P_m^{(k)}$ are the unique first elements in $S_\alpha$-order, so they minimize every $\mathcal{A}_\alpha$-spectral moment that distinguishes the family.
  • For every $\alpha \in (0,1)$, the triangle-with-pendants $C_3^{(k)} \odot S_{m-3}^{(k)}$ and the hyperstar $S_m^{(k)}$ are the unique last elements, hence they maximize the second $\mathcal{A}_\alpha$-spectral moment in their families.
  • Fixing girth or diameter does not change the qualitative picture: the first unicyclic shape is the cycle with a single long path attached, the last is the cycle with all extra hyperedges piled onto one vertex, and the last hypertree of given diameter is the starlike shape centered at the middle of the diameter.
  • The extreme values of the $2$-nd and $(k+2)$-nd order $\mathcal{A}_\alpha$-spectral moments for both families are explicitly attained by these extremal hypergraphs, giving concrete extremal trace formulas.
  • For $k=2$, the results reduce to new statements about $\mathcal{A}_\alpha$-spectral moments of graphs.

Reading between the lines

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

  • Because every comparison in the proofs is governed by positive factors like $\alpha^2(1-\alpha)^k$, the same extremal shapes should persist for all $\alpha \in (0,1)$; a natural extension is to examine the limits $\alpha \to 0$ and $\alpha \to 1$, where the ordering should degenerate toward ordinary spectral-moment order and degree-sequence order, respectively.
  • A direct enumeration for small $k$ and $m$, computing the trace vectors via Theorem 3.3, would provide an independent check of the claimed order and could reveal exactly where an iterative reduction sequence fails if it does.
  • The pattern suggests a transferable principle: in $S_\alpha$-order, concentrating degrees toward a star moves a hypergraph to the end, while stretching a single spine toward a path moves it to the front; analogous extremal shapes may hold for hypergraphs with larger cyclomatic number or with degree bounds.
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

4 major / 4 minor

Summary. The paper studies the lexicographic ordering of k-uniform hypergraphs by the sequence of A_α-tensor spectral moments (S_α-order). Section 3 derives formulas for low-order traces, including a formula for Tr_{k+2}(A_α(H)) in Theorem 3.3. Section 4 establishes monotonicity lemmas for four local transformations: a σ-transformation that moves pendant hyperedges between vertices, and three path-sliding transformations. Sections 5 and 6 apply these lemmas to characterize the first, second, last, and second-last hypergraphs in S_α-order among all k-uniform linear unicyclic hypergraphs and hypertrees, and also the extremal hypergraphs with prescribed girth or diameter. Section 7 translates these orderings into extrema of the 2nd and (k+2)-nd A_α-spectral moments. The central claims are Theorem 5.2 (last unicyclic hypergraph is C_3^{(k)} ⊙ S_{m-3}^{(k)}), Theorem 5.3 (second last is C_{3;m-4,1,0}^{(k)}), Theorem 5.6 (first unicyclic hypergraph is C_m^{(k)}), Theorem 6.2 (first hypertree is P_m^{(k)}), and Theorem 6.6 (second last hypertree is S_{1,2,1,...,1}^{(k)}).

Significance. If the extremal characterizations were fully proved, they would settle the extremal hypergraphs in the A_α-spectral moment order for two natural families and would provide new extremal results for the 2nd and (k+2)-nd A_α-spectral moments. The trace formula in Theorem 3.3, derived from Shao et al.'s tensor trace formula and the Harary-Sachs theorem, is a nontrivial and potentially reusable technical contribution. The monotonicity lemmas for single local transformations are plausible and, in the cases verified, give the right sign of the trace differences. However, as detailed in the major comments, the main ordering theorems contain a false statement and rely on an unverified iterative use of the local lemmas; the extremal characterizations are therefore not established by the present manuscript.

major comments (4)
  1. [Theorem 5.3] Theorem 5.3 is false as stated. For m = 4, the hypergraph C_{3;m-4,1,0}^{(k)} = C_{3;0,1,0}^{(k)} is exactly C_3^{(k)} ⊙ S_1^{(k)}, which is the last hypergraph in S_α-order by Theorem 5.2, so it cannot be the second last. For m = 3, the expression C_{3;-1,1,0}^{(k)} is undefined. The theorem needs at least a restriction such as m ≥ 5 and a separate treatment of small m. In addition, the proof only considers hypergraphs of the special form obtained by adding one pendant hyperedge to C_3^{(k)} ⊙ S_{m-4}^{(k)} and asserts that the second last 'might be' one of these; it does not exclude other candidates, such as those with a different distribution of pendant hyperedges among the three non-cored vertices of C_3^{(k)}. This is a load-bearing gap in the claimed second-last characterization.
  2. [Lemmas 4.1–4.4; Theorems 5.1, 5.4, 5.5, 6.1–6.5] The main ordering theorems rely on the assertion that any hypergraph in the relevant family can be transformed into the claimed extremal hypergraph by a sequence of σ-transformations or path-sliding transformations, each strictly decreasing in S_α-order. However, Lemmas 4.1–4.4 are proved only for a single, specific local configuration. For example, Lemma 4.3 requires the hypergraph to be a coalescence of one hyperpath P_r^{(k)} at a cored vertex on e_l with another hypergraph, where 2 ≤ l ≤ ⌈r/2⌉ and r ≥ 3, while Lemma 4.4 requires 1 ≤ l ≤ ⌊r/2⌋ and r ≥ 2. The proofs of Theorems 5.1, 5.4, 5.5, 6.1, 6.2, and 6.5 contain statements such as 'repeating σ-transformation' or 'using the second path-sliding transformation repeatedly' without verifying that after each move the resulting hypergraph still satisfies the hypotheses of the lemma: the path length r and attachment position l must remain in the stated ranges, the hypergraph must still be a coalescence of a single hyperpath with the original core, and, for Lemma 4.1, the degree condition d_H(u) < d_H(v) + s must continue to hold. When a hypergraph has more than one branch, moving one branch changes the lengths of paths and the positions of attachment points, so the next move can fall outside the lemma's scope. Without a verified induction, the chain H ≺_α H_1 ≺_α ... ≺_α extremal is not established for the multi-branch structures that the theorems claim to cover.
  3. [Proof of Theorem 5.5] The proof of Theorem 5.5 asserts, after reducing to a hypergraph U' with the same degree sequence as C_g^{(k)} · P_{m-g}^{(k)}, that 'from Theorem 3.3, it can be obtained that Tr_{k+2}(A_α(C_g^{(k)} · P_{m-g}^{(k)})) ≤ Tr_{k+2}(A_α(U'))'. No derivation of this inequality is given, and the text acknowledges that U' may have more than one hyperedge with at least three vertices of degree 2, so the comparison is not immediate. The difference of the k+2-th traces depends on the detailed distribution of the terms Σ_{i∈e} d_i^2 and Σ_{{i,j}⊂e} d_i d_j over the hyperedges, and this must be computed explicitly to justify the inequality and its equality case. Since this comparison is the step that identifies C_g^{(k)} · P_{m-g}^{(k)} as the first hypergraph among all linear unicyclic hypergraphs of girth g, the proof of Theorem 5.5 is incomplete.
  4. [Proofs of Theorems 5.6 and 5.7] The proofs of Theorems 5.6 and 5.7 contain several displayed trace comparisons that are asserted without derivation, and some invariants are stated without proof. For instance, Theorem 5.6 gives the displayed identity Tr_{k+2}(A_α(C_m^{(k)})) - Tr_{k+2}(A_α(C_g^{(k)} · P_{m-g}^{(k)})) = -(k+2)(k-1)^{m(k-1)-k} k^{k-2} α^2(1-α)^k without showing the computation; Theorem 5.7 asserts that 'we can know that V_d(U_1) = V_d(U_2)' for d = 1,...,2k+1 and all U_1, U_2 in the relevant set, again without proof. These statements are load-bearing for the first and second hypergraph characterizations, respectively, and need to be justified explicitly.
minor comments (4)
  1. [Abstract and Section 1] There are several typographical errors: 'grith' in the abstract should be 'girth', 'Aα-sepctral' in Section 1 should be 'Aα-spectral', and 'silding' in Section 4 should be 'sliding'.
  2. [Section 5, notation] The notation U_{m,g} is used twice in Lemma 5.4 with two different meanings: first as the set of all k-uniform linear unicyclic hypergraphs with m hyperedges and girth g, and then as the subset whose vertices all have degree at most 2. This overloaded notation is confusing and should be changed.
  3. [Definition of 'cored vertex' and its use] The paper defines a cored vertex as a vertex of degree one, but later uses 'cored vertices of C_g^{(k)}' in the definition of C_g^{(k)} · P_{m-g}^{(k)}; vertices of a hypercycle have degree two, so the terminology is inconsistent and should be clarified.
  4. [Proof of Lemma 4.3, l = 2 case] In the proof of Lemma 4.3, the comparison of Tr_{k+2} is performed by writing the difference of sums over the first two hyperedges, but the displayed formula appears to assume a particular labeling and degree pattern; it would help to state explicitly the degree assumptions on the vertices of the first two hyperedges.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the ordering results are derived from an independent tensor-trace formula and Harary-Sachs counts, not from the claims being proved.

full rationale

The paper's derivation chain is self-contained in the relevant sense. Theorem 3.1 obtains the A_alpha-spectral moment expression from Shao et al.'s tensor-trace formula (Lemma 2.1, an external result) and a case decomposition. The only overlapping-author citation in this part, [27], supplies a technical decomposition for Laplacian spectral moments; it is used as a lemma, not as an assumption of the target ordering results, and it is externally published and falsifiable. Corollary 3.2 and Theorem 3.3 are then computed directly from Theorem 3.1. The monotonicity lemmas 4.1-4.4 prove that sigma- and path-sliding transformations strictly decrease the S_alpha-order using the explicit trace formulas and Clark-Cooper's Harary-Sachs theorem (Lemma 13 of [8]), which is independent of the present claims. The main theorems 5.1-5.7 and 6.1-6.6 apply these monotonicity lemmas; they do not fit parameters and do not assume the extremal hypergraphs they identify. Thus no 'prediction' reduces to an input by construction, and no self-citation chain forces the conclusions. The gaps noted by the reader (unverified iteration hypotheses in the transformation proofs and an unproved inequality in Theorem 5.5) are correctness risks, not circularity.

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

The central results depend on standard tensor and hypergraph results, plus self-cited previous work for the trace technique. No fitted parameters or invented entities. The only subtle assumption is that all hypergraphs within each family share the same vertex count, which holds for hypertrees and linear unicyclic hypergraphs.

assumptions (5)
  • standard math Shao et al. tensor trace formula (Lemma 2.1, [34])
    Used as the starting point for all spectral moment expressions, without re-derivation.
  • standard math Clark-Cooper Harary-Sachs theorem (Lemma 13 in [8]) connecting adjacency spectral moments to counts of Veblen infragraphs
    Invoked in Lemmas 4.3, 4.4 and Theorem 5.7 to identify which subhypergraphs contribute to high-order moments.
  • standard math Cayley's formula k^{k-2} for rooted spanning trees of a complete digraph ([2])
    Used to evaluate tau(f) in Theorems 3.3 and 5.7.
  • standard math The number of eigenvalues of a k-order n-dimensional tensor is n(k-1)^{n-1}
    Used in Definition 2.2 and for Tr_0.
  • domain assumption Every hypertree with m edges has n=m(k-1)+1 vertices and every linear unicyclic hypergraph with m edges has n=m(k-1) vertices
    Ensures Tr_0 and Tr_1 are constant within each family, making Tr_2 the first distinguishing moment; stated implicitly in Sections 5 and 6.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The ordering of hypertrees and unicyclic hypergraphs by the traces of $\mathcal{A}_{\alpha}$-tensor." pith.science (2026). https://pith.science/paper/7YKPARCJ

@misc{pith2026250702650,
  author       = {Pith},
  title        = {Pith review of: The ordering of hypertrees and unicyclic hypergraphs by the traces of $\mathcalA_\alpha$-tensor},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7YKPARCJ}},
  note         = {Machine review of arXiv:2507.02650}
}
abstract

For a real number $\alpha\in[0,1]$ and a $k$-uniform hypergraph $\mathcal{H}$, $\mathcal{A}_{\alpha}(\mathcal{H})=\alpha\mathcal{D}(\mathcal{H})+(1-\alpha)\mathcal{A}(\mathcal{H})$ is called the $\mathcal{A}_{\alpha}$-tensor of $\mathcal{H}$, where $\mathcal{D}(\mathcal{H})$ and $\mathcal{A}(\mathcal{H})$ are the degree tensor and adjacency tensor of $\mathcal{H}$, respectively. The sum of the $d$-th powers of all eigenvalues of $\mathcal{A}_{\alpha}(\mathcal{H})$ is called the $d$-th order $\mathcal{A}_{\alpha}$-spectral moment of $\mathcal{H}$, which is equal to the $d$-th order trace of $\mathcal{A}_{\alpha}(\mathcal{H})$. In this paper, some hypergraphs are ordered lexicographically by their $\mathcal{A}_{\alpha}$-spectral moments in non-decreasing order. The first, the second, the last and the second last hypergraphs among all $k$-uniform linear unicyclic hypergraphs and hypertrees are characterized, respectively. We give the first and the last hypergraphs among all $k$-uniform linear unicyclic hypergraphs with given grith, and characterize the last hypertree among all $k$-uniform hypertrees with given diameter. Furthermore, we determine some extreme values of the $\mathcal{A}_{\alpha}$-spectral moments for hypertrees and linear unicyclic hypergraphs, respectively.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

42 extracted references · 41 canonical work pages

  1. [41]

    Lexicographical ordering of hypergraphs via spectral moment

    H. Zhou and C. Bu. Lexicographical ordering of hypergraphs via spectral mo- ment. arXiv:2309.16925

    work page Pith review arXiv

  2. [1]

    Bussemaker, S

    F. Bussemaker, S. ´Cobelji´ c, D. Cvetkovi´ c, and J. Seidel. Computer investigation of cubic graphs. 1976. EUT report. WSK, Dept. of Mathematics and Computing Science, Technische Hogeschool Eindhoven

    work page 1976

  3. [2]

    A. Cayley. A theorem on trees. Quart. J. Math. , 23:376–378, 1889

    work page

  4. [3]

    L. Chen, C. Bu, and J. Zhou. Spectral moments of hypertrees and their appli- cations. Linear Multilinear Algebra, 70(21):6297–6311, 2022

    work page 2022

  5. [4]

    L. Chen, L. Sun, and C. Bu. High-order spectral characterizations of graphs. Discrete Math., 348:114421, 2025

    work page 2025

  6. [5]

    Chen, E.R

    L. Chen, E.R. van Dam, and C. Bu. Spectra of power hypergraphs and signed graphs via parity-closed walks. J. Combin. Theory Ser. A , 207:105909, 2024

    work page 2024

  7. [6]

    Cheng and B

    B. Cheng and B. Liu. Lexicographical ordering by spectral moments of trees with k pendant vertices and integer partitions. Appl. Math. Lett. , 25(5):858– 861, 2012

    work page 2012

  8. [7]

    Cheng, B

    B. Cheng, B. Liu, and J. Liu. On the spectral moments of unicyclic graphs with fixes diameter. Linear Algebra Appl., 437(4):1123–1131, 2012

    work page 2012

Show all 42 references
  1. [8]

    Clark and J

    G. Clark and J. Cooper. A Harary-Sachs theorem for hypergraphs. J. Combin. Theory Ser. B , 149:1–15, 2021

    2021

  2. [9]

    Cooper and A

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

    2012

  3. [10]

    Cooper and A

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

    2015

  4. [11]

    Cvetkovi´ c

    D. Cvetkovi´ c. Some possible directions in further investigations of graph spec- tra. Algebra Methods in Graph Theory, vol. 1, North-Holland, Amsterdam, 1981, pp. 47-67

    1981

  5. [12]

    Cvetkovi´ c and M

    D. Cvetkovi´ c and M. Petri´ c. A table of connected graphs on six vertices.Dis- crete Math., 50:37–49, 1984

    1984

  6. [13]

    Cvetkovi´ c and P

    D. Cvetkovi´ c and P. Rowlinson. Spectra of unicyclic graphs. Graph Combina- tor., 3(1):7–23, 1987

    1987

  7. [14]

    Cvetkovi´ c, P

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

    2009

  8. [15]

    Duan, E.R

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

    2023

  9. [16]

    Y. Fan, T. Huang, Y. Bao, C. Zhuan-Sun, and Y. Li. The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs. Trans. Amer. Math. Soc. , 372(3):2213–2233, 2019

    2019

  10. [17]

    Y. Fan, H. Yang, and J. Zheng. High-ordered spectral characterization of uni- cyclic graphs. Discuss. Math. Graph T. , 44(3):1107–1141, 2024

    2024

  11. [18]

    Y. Fan, Y. Yang, C. She, J. Zheng, Y. Song, and H. Yang. The trace and Estrada index of uniform hypergraphs with cut vertices. Linear Algebra Appl., 660:89–117, 2023

    2023

  12. [19]

    L. Fang, B. Wang, and M. Zhai. On the spectral moment of quasi-bicyclic graphs. Appl. Math, Comput. , 363:124601, 2019

    2019

  13. [20]

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

    2022

  14. [21]

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

    2020

  15. [22]

    S. Hu, Z. Huang, C. Ling, and L. Qi. On determinants and eigenvalue theory of tensors. J. Symbolic Comput. , 50:508–531, 2013. 24

    2013

  16. [23]

    H. Li, L. Su, and S. Fallat. On a relationship between the characteristic and matching polynomials of a uniform hypertree.Discrete Math., 347:113915, 2024

    2024

  17. [24]

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

    2005

  18. [25]

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

    2020

  19. [26]

    H. Lin, J. Xue, and J. Shu. On the Aα-spectra of graphs. Linear Algebra Appl., 556:210–219, 2018

    2018

  20. [27]

    J. Liu, L. Chen, and C. Bu. The Laplacian spectral moments of uniform hy- pergraphs. Discrete Appl. Math. , 365:91–99, 2025

    2025

  21. [28]

    Morozov and S

    A. Morozov and S. Shakirov. Analogue of the identity Log Det = Trace Log for resultants. J. Geom. Phys. , 61(3):708–726, 2011

    2011

  22. [29]

    Nikiforov

    V. Nikiforov. Hypergraphs and hypermatrices with symmetric spectrum. Linear Algebra Appl., 519:1–18, 2017

    2017

  23. [30]

    Nikiforov

    V. Nikiforov. Merging the A- and Q-spectral theories. Appl. Anal. Discrete Math., 11:81–107, 2017

    2017

  24. [31]

    X. Pan, X. Hu, X. Liu, and H. Liu. The spectral moments of trees with given maximum degree. Appl. Math. Lett. , 24(7):1265–1268, 2011

    2011

  25. [32]

    L. Qi. Eigenvalues of a real supersymmetric tensor. J. Symbolic Comput. , 40(6):1302–1324, 2005

    2005

  26. [33]

    L. Qi. H +-Eigenvalues of Laplacian and signless Laplacian tensors. Commun. Math. Sci. , 12:1045–1064, 2014

    2014

  27. [34]

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

    2015

  28. [35]

    L. Sun, B. Zheng, C. Bu, and Y. Wei. Moore-Penrose inverse of tensors via Einstein product. Linear Multilinear Algebra, 64(4):686–698, 2016

    2016

  29. [36]

    W. Wang, J. Zhou, and R. Sun. On the conjecture of the r-uniform supertrees with the eight largest α-spectral radii. Discrete Appl. Math., 322:311–319, 2022. 25

    2022

  30. [37]

    Wu and H

    Y. Wu and H. Liu. Lexicographical ordering by spectral moments of trees with a prescribed diameter. Linear Algebra Appl., 433(11-12):1707–1713, 2010

    2010

  31. [38]

    Y. Wu, H. Liu, and Q. Fan. On the spectral moments of signless laplacian matrix of trees and unicyclic graphs. Ars Comb., 141:345–351, 2018

    2018

  32. [39]

    Yu and S

    Y. Yu and S. Li. On the Aα-index of C4-free graphs with given order or size. Electron. J. Combin. , 32(2), 2025. Article ID #P2.23

    2025

  33. [40]

    Zhang and X

    P. Zhang and X. Zhang. Lower bounds for the Aα-spectral radius of uniform hypergraphs. Linear Algebra Appl., 631:308–327, 2021

    2021

  34. [42]

    H. Zhou, L. Sun, and C. Bu. Estrada index and subgraph centrality of hyper- graphs via tensors. Discrete Appl. Math. , 341:120–129, 2023. 26

    2023

Pith tools

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