On the spectra of k-uniform threshold hypergraphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911467289182208 |
|---|---|
| author | Abdón, Miriam Portugal, Lucas Del-Vecchio, Renata de Freitas, Renata |
| author_facet | Abdón, Miriam Portugal, Lucas Del-Vecchio, Renata de Freitas, Renata |
| contents | In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by means of combinatorial numbers, derived from edge counts. An important problem addressed in Spectral Graph Theory is to find graphs with few distinct eigenvalues. Our characterization allows us to construct k-uniform threshold hypergraphs having an arbitrary number of vertices with few distinct eigenvalues. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_21382 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the spectra of k-uniform threshold hypergraphs Abdón, Miriam Portugal, Lucas Del-Vecchio, Renata de Freitas, Renata Combinatorics 05C65 In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by means of combinatorial numbers, derived from edge counts. An important problem addressed in Spectral Graph Theory is to find graphs with few distinct eigenvalues. Our characterization allows us to construct k-uniform threshold hypergraphs having an arbitrary number of vertices with few distinct eigenvalues. |
| title | On the spectra of k-uniform threshold hypergraphs |
| topic | Combinatorics 05C65 |
| url | https://arxiv.org/abs/2602.21382 |