The Extremal p-Spectral Radius of Special Berge Hypergraph

Let [Formula: see text] be a graph. We say that a hypergraph [Formula: see text] is Berge-[Formula: see text] if there exists a bijection [Formula: see text] from [Formula: see text] to [Formula: see text] such that [Formula: see text] for all [Formula: see text]. For any [Formula: see text]-uniform hypergraph [Formula: see text] and a real number [Formula: see text], the [Formula: see text]-spectral radius [Formula: see text] of [Formula: see text] is defined as [Formula: see text]. We study the [Formula: see text]-spectral radius of Berge-[Formula: see text] hypergraphs and determine the 3-uniform hypergraphs with maximum [Formula: see text]-spectral radius for [Formula: see text]among Berge-[Formula: see text] hypergraphs when [Formula: see text] is a tree that looks like [Formula: see text] with [Formula: see text] vertices.