REVIEW 3 cited by
Lexicographical ordering of hypergraphs via spectral moment
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 3 Pith papers
-
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.
-
Lexicographical ordering by spectral moments of bicyclic hypergraphs
For linear k-uniform bicyclic hypergraphs with fixed girth and number of edges, the paper determines which hypergraph is first and which is last in the spectral-moment order.
-
Extremal Zagreb indices of bicyclic hypergraphs
For linear bicyclic k-uniform hypergraphs, the maximum Zagreb index is attained by an explicit theta-like hypergraph, and the minimum by any hypergraph with maximum degree 2.
Discussion (0). Continue with ORCID to comment.