Cargando…

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

Descripción completa

Detalles Bibliográficos
Autores principales: Jia, Huicai, Xue, Jie
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5388782/
https://www.ncbi.nlm.nih.gov/pubmed/28458483
http://dx.doi.org/10.1186/s13660-017-1348-5