Загрузка...

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

Полное описание

Сохранить в:
Библиографические подробности
Опубликовано в: :J Inequal Appl
Главные авторы: Jia, Huicai, Xue, Jie
Формат: Artigo
Язык:Inglês
Опубликовано: Springer International Publishing 2017
Предметы:
Online-ссылка: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
Метки: Добавить метку
Нет меток, Требуется 1-ая метка записи!