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...
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 |
Similar Items
-
The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number
by: Su Li, et al.
Published: (2014-02-01) -
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs
by: Xi Weige, et al.
Published: (2016-11-01) -
Upper Bounds for the Strong Chromatic Index of Halin Graphs
by: Hu Ziyu, et al.
Published: (2018-02-01) -
Spectral properties of a class of unicyclic graphs
by: Zhibin Du
Published: (2017-05-01) -
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
by: Lu Hongyan, et al.
Published: (2014-11-01)