The signless Laplacian spectral radius of graphs without trees

arXiv2209.03120MaRDI QIDQ6409984FDOQ6409984

Authors: Ming-Zhu Chen, Zhaoming Li, Xiao-Dong Zhang 

Publication date: 7 September 2022

Abstract: Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix of $G$, respectively. In this paper, we present a sharp upper bound for the signless spectral radius of $G$ without any tree and characterize all extremal graphs which attain the upper bound, which may be regarded as a spectral extremal version for the famous ErdH{o}s-S'{o}s conjecture.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)

This page was built for publication: The signless Laplacian spectral radius of graphs without trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409984)