Spectral radius and Hamiltonicity of uniform hypergraphs

DOI10.1016/J.DISC.2026.115184MaRDI QIDQ7285274zbMATH OpenFDO

Authors George Brooks, William Linz, Ruth Luo

Publication date 19 June 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115184

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65)

Cites work

• A bound on the spectral radius of graphs with \(e\) edges
• A bound on the spectral radius of hypergraphs with \(e\) edges
• Analytic methods for uniform hypergraphs
• Minimum degree ensuring that a hypergraph is Hamiltonian-connected
• Some spectral sufficient conditions for a graph being pancyclic
• Some Theorems on Abstract Graphs
• Spectra of uniform hypergraphs
• Spectral radius and Hamiltonian graphs
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs
• Spectral radius and Hamiltonicity of graphs with large minimum degree.

This page was built for publication: Spectral radius and Hamiltonicity of uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285274)