The maximum spectral radii of uniform supertrees with given degree sequences

This paper generalizes the breadth-first-search ordering on trees to k-uniform supertrees. By using 2-switch operation and edge-moving operation on supertrees, we determine the unique k-uniform supertree with the maximum spectral radius among all k-uniform supertrees with a given degree sequence. Moreover, we generalize the majorization theorem on trees to k-uniform supertrees.