# Spectral radius of uniform hypergraphs and degree sequences

## TL;DR

This paper establishes new upper bounds for the spectral radii of uniform hypergraphs' adjacency and signless Laplacian matrices based on their degree sequences, advancing spectral hypergraph theory.

## Contribution

It introduces novel bounds relating spectral radii to degree sequences in uniform hypergraphs, filling gaps in spectral hypergraph analysis.

## Key findings

- Derived upper bounds for spectral radii based on degree sequences
- Extended spectral bounds to both adjacency and signless Laplacian matrices
- Enhanced understanding of spectral properties in uniform hypergraphs

## Abstract

In this paper, we present several upper bounds for the adjacency and signless Laplacian spectral radii of uniform hypergraphs in terms of degree sequences.