[HTML][HTML] Extremal Halin graphs with respect to the signless Laplacian spectra
M Zhang, S Li - Discrete Applied Mathematics, 2016 - Elsevier
A Halin graph G is a plane graph constructed as follows: Let T be a tree on at least 4
vertices. All vertices of T are either of degree 1, called leaves, or of degree at least 3. Let C …
vertices. All vertices of T are either of degree 1, called leaves, or of degree at least 3. Let C …
Hamiltonicity in k-tree-Halin Graphs
A Shabbir, T Zamfirescu - … and Discrete Geometry Including Graph Theory …, 2016 - Springer
A k-tree-Halin graph is a planar graph F ∪ CF∪ C, where F is a forest with at most k
components and C is a cycle, such that V (C) is the set of all leaves of F, C bounds a face …
components and C is a cycle, such that V (C) is the set of all leaves of F, C bounds a face …