Sombor spectral radius of hypergraphs

In the literature, both algebraic and analytical techniques have been used to examine the spectral radius of the matrices. Numerous studies have been carried out in this field, although determining the largest eigenvalue of the hypermatrices using an algebraic technique was only recently initiated. A few bounds for the Sombor spectral radius of uniform hypergraphs are established in this work. Additionally, the spectral radius of the generalized power hypergraph is determined, and hence for power hypergraphs. The weighted incidence matrix associated with the hypergraph can be used to obtain the expression (and bounds) for the spectral radius of the adjacency hypermatrix of uniform hypergraphs. The expression and a bound for the spectral radius of the degree-based-extended adjacency hypermatrix of uniform hypergraphs are provided in this study, which generalizes the technique initially proposed by Lu and Man to the adjacency hypermatrix.