Lexicographical ordering by spectral moments of bicyclic hypergraphs

2025/06/13 by Hong Zhou, Changjiang Bu, Zhou, Hong +1
Computer Science · #Combinatorics (math.CO) #FOS: Mathematics #Rough Sets and Fuzzy Logic

paper · pdf · doi:10.48550/arxiv.2506.11907

openalex publication_date 2025/06/13 · openalex created_date 2025/10/11 · openalex updated_date 2026/07/28

Abstract

For bicyclic hypergraphs, ordering by spectral moment (S-order) is investigated in this paper. We give the first and last hypergraphs in an S-order of linear bicyclic uniform hypergraphs with given girth and number of edges.

Citations

• Extremal Zagreb indices of bicyclic hypergraphs
• Lexicographical ordering of hypergraphs via spectral moment
• Spectra of power hypergraphs and signed graphs via parity-closed walks
• The stabilizing index and cyclic index of coalescence and Cartesian product of uniform hypergraphs
• A Harary-Sachs Theorem for Hypergraphs
• On the irregularity of uniform hypergraphs
• The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
• Some new trace formulas of tensors with applications in spectral hypergraph theory
• Cored Hypergraphs, Power Hypergraphs and Their Laplacian H-Eigenvalues
• On the spectral moment of graphs with given clique number
• On the spectral moment of graphs with k cut edges
• Spectra of uniform hypergraphs

Related

• Lexicographical ordering of hypergraphs via spectral moment
• The ordering of hypertrees and unicyclic hypergraphs by the traces of A_α-tensor
• On the spectral moment of graphs with given clique number
• The first few unicyclic and bicyclic hypergraphs with larger spectral radii
• Extremal Zagreb indices of bicyclic hypergraphs