On the Laplacian spectral radii of Halin graphs

Abstract 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 wi...

Full description

Bibliographic Details
Main Authors: Huicai Jia, Jie Xue
Format: Article
Language:English
Published: Springer 2017-04-01
Series:Journal of Inequalities and Applications
Subjects:
Online Access:http://link.springer.com/article/10.1186/s13660-017-1348-5