Loading...

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

Full description

Saved in:
Bibliographic Details
Published in:J Inequal Appl
Main Authors: Jia, Huicai, Xue, Jie
Format: Artigo
Language:Inglês
Published: Springer International Publishing 2017
Subjects:
Online Access:https://ncbi.nlm.nih.gov/pmc/articles/PMC5388782/
https://ncbi.nlm.nih.gov/pubmed/28458483
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13660-017-1348-5
Tags: Add Tag
No Tags, Be the first to tag this record!