Back to Search
Start Over
On a conjecture related to the smallest signless Laplacian eigenvalue of graphs.
- Source :
- Linear & Multilinear Algebra; Dec2022, Vol. 70 Issue 19, p4425-4431, 7p
- Publication Year :
- 2022
-
Abstract
- For a simple graph G, the signless Laplacian matrix of G, denoted by Q(G), is defined as D(G) + A(G), where A(G) and D(G) are the adjacency matrix and the diagonal matrix of vertex degrees of G, respectively. By the smallest signless Laplacian eigenvalue of G, denoted by q′(G), we mean the smallest eigenvalue of Q(G). Let T(n, t) be the Turán graph on n vertices and t parts. In De Lima et al. (The clique number and the smallest Q-eigenvalue of graphs. Discrete Math. 2016;339:1744–1752), the authors posed the following conjecture:Conjecture. Let t ≥ 3 and let n be sufficiently large. If G is a K<subscript>t+1</subscript>-free graph of order n and G ≠ T(n, t), then q′(G) < q′(T(n, t)).In this paper, first we disprove the above conjecture and then pose a new conjecture. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03081087
- Volume :
- 70
- Issue :
- 19
- Database :
- Complementary Index
- Journal :
- Linear & Multilinear Algebra
- Publication Type :
- Academic Journal
- Accession number :
- 162536137
- Full Text :
- https://doi.org/10.1080/03081087.2021.1881035