Name
Abstract | ||
|---|---|---|
A connected graph G is called a quasi-tree graph, if there exists v(0) is an element of V (G) such that G - v(0) is a tree. In this paper, among all triangle-free quasi-tree graphs of order n with G - v(0) being a tree and d(v(0)) = d(0), we determine the maximal and the second maximal signless Laplacian spectral radii together with the corresponding extremal graphs. By an analogous manner, we obtained similar results on the spectral radius of triangle-free quasi-tree graphs. |
Year | Venue | Keywords |
|---|---|---|
2016 | ARS COMBINATORIA | quasi-tree graph,triangle-free,signless Laplacian,spectral radius |
Field | DocType | Volume |
Discrete mathematics,Odd graph,Indifference graph,Combinatorics,Tree (graph theory),Partial k-tree,Pathwidth,1-planar graph,Mathematics,Pancyclic graph,Dense graph | Journal | 126 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shu-Guang Guo | 1 | 1 | 2.42 |
| Guanglong Yu | 2 | 28 | 11.07 |