On the Laplacian spectral radii of Halin graphs

Let T be a tree with at least four vertices, none of which has degree 2, embedded in the plane. A Halin graph is a plane graph constructed by connecting the leaves of T into a cycle. Thus the cycle C forms the outer face of the Halin graph, with the tree inside it. Let G be a Halin graph with order n. Denote by [Formula: see text] the Laplacian spectral radius of G. This paper determines all the Halin graphs with [Formula: see text] . Moreover, we obtain the graphs with the first three largest Laplacian spectral radius among all the Halin graphs on n vertices.