Lexicographical ordering by spectral moments of bicyclic hypergraphs
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.