Name
Abstract | ||
|---|---|---|
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 be a cycle connecting the leaves of T in such a way that C forms the boundary of the unbounded face. Denote the set of all n -vertex Halin graphs by G n . In this article, sharp upper and lower bounds on the signless Laplacian indices of graphs among G n are determined and the extremal graphs are identified, respectively. As well graphs in G n having the second and third largest signless Laplacian indices are determined, respectively. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.dam.2016.05.020 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Halin graph,Signless Laplacian index,Sharp bound,Extremal graph | Discrete mathematics,Wheel graph,Indifference graph,Combinatorics,Partial k-tree,Chordal graph,Treewidth,Pathwidth,Halin graph,Mathematics,Pancyclic graph | Journal |
Volume | Issue | ISSN |
213 | C | 0166-218X |
Citations | PageRank | References |
1 | 0.38 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minjie Zhang | 1 | 255 | 30.01 |
| Shuchao Li | 2 | 183 | 35.15 |