The paper characterizes the extremal hypertrees and linear unicyclic hypergraphs under the lexicographic order induced by the A_alpha spectral moments.
Lexicographical ordering of hypergraphs via spectral moment
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The lexicographical ordering of hypergraphs via spectral moments is called the $S$-order of hypergraphs.In this paper, the $S$-order of hypergraphs is investigated.We characterize the first and last hypergraphs in an $S$-order of all uniform hypertrees and all linear unicyclic uniformhypergraphs with given girth, respectively. And we give the last hypergraph in an $S$-order of all linear unicyclic uniform hypergraphs.
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The ordering of hypertrees and unicyclic hypergraphs by the traces of $\mathcal{A}_{\alpha}$-tensor
The paper characterizes the extremal hypertrees and linear unicyclic hypergraphs under the lexicographic order induced by the A_alpha spectral moments.