The maximum spectral radius of uniform hypergraphs with given number of pendant edges

In this paper, we introduce the operations of grafting an edge and subdividing an edge on hypergraphs, and consider how spectral radius of a hypergraph behaves by grafting an edge or subdividing an edge. As an application, we determine the unique hypergraphs with the maximum spectral radius among all the uniform supertrees and all the connected uniform unicyclic hypergraphs with given number of pendant edges, respectively. Moreover, we determine the unique uniform supertree which attains the maximum spectral radius among all the uniform supertrees with given number of pendant vertices.