Extremal Halin graphs with respect to the signless Laplacian spectra

Abstract

a b s t r a c tA 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.

A survey on spectral conditions for some extremal graph problems

“…For the Q-index counterpart of the above problem, Zhang [192] gave the Q-index of graphs with given degree sequence, Zhou [195] studied the Q-index and Hamiltonicity. Also, from both theoretical and practical viewpoint, the eigenvalues of graphs have been successfully used in many other disciplines, one may refer to [118,189,190].…”

A tight $Q$-index condition for a graph to be $k$-path-coverable involving minimum degree

“…For the Q-index counterpart of the above problem, Zhang [33] gave the Q-index of graphs with given degree sequence, Zhou [35] studied the Q-index and Hamiltonicity. Also, from both theoretical and practical viewpoint, the eigenvalues of graphs have been successfully used in many other disciplines, one may refer to [14,17,18,32,34].…”

The Q-index and connectivity of graphs

“…For the Q-index counterpart of the above problem, Zhang [31] gave the Q-index of graphs with given degree sequence, Zhou [32] studied the Q-index and Hamiltonicity. Also, from both theoretical and practical viewpoint, the eigenvalues of graphs have been successfully used in many other disciplines, one may refer to [15,17,18,29,30].…”