Discrete Applied Mathematics· 2026Q2
Adjacency spectral characterizations for the toughness of hypergraphs
- 0citations
- Q2SCImago
- 2026year
Short summary
New spectral radius conditions characterize t-toughness in hypergraphs, extending graph theory results.
AI-generated from the title and abstract; the full text is not read.
Key points
- Establishes spectral radius conditions for t-toughness in hypergraphs.
- Extends existing spectral theories from graphs to hypergraphs.
- Provides a complete characterization of extremal hypergraphs for t-toughness.
AI-generated from the title and abstract; the full text is not read.
Abstract
Toughness measures how well a graph remains connected after vertex deletions. Fan et al. (2023) presented spectral conditions for a graph to be t -tough. Motivated by their work, this paper investigates the adjacency spectrum of hypergraphs and establishes spectral radius conditions for t -tough in hypergraphs. These results extend the corresponding theories in graphs and provide a complete characterization of the extremal hypergraphs.
The authors' abstract, as published at the source. Discrete Applied Mathematics, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computational Mathematics
Computational MathematicsMathematics