The largest spectral radius of uniform hypertrees with a given size of matching

TL;DR

This paper determines the maximum spectral radius of uniform hypertrees with a fixed number of edges and a specified matching size, using matching polynomial theory and hypertree ordering.

Contribution

It introduces a method to identify the largest spectral radius of hypertrees based on matching polynomial theory and hypertree ordering.

Findings

Identifies the hypertree with the maximum spectral radius for given parameters.

Provides a theoretical framework linking matching polynomial and spectral radius.

Enhances understanding of spectral properties of hypertrees.

Abstract

In this paper, using the theory of matching polynomial of hypertrees and ordering of hypertrees, we determine the largest spectral radius of hypertrees with $m$ edges and given size of matching.