The signless Laplacian spectral radius of graphs with forbidding linear forests
Combinatorics
2020-07-20 v1
Abstract
Tur\'{a}n type extremal problem is how to maximize the number of edges over all graphs which do not contain fixed forbidden subgraphs. Similarly, spectral Tur\'{a}n type extremal problem is how to maximize (signless Laplacian) spectral radius over all graphs which do not contain fixed subgraphs. In this paper, we first present a stability result for in terms of the number of edges and then determine all extremal graphs maximizing the signless Laplacian spectral radius over all graphs which do not contain a fixed linear forest with at most two odd paths or as a subgraph, respectively.
Keywords
Cite
@article{arxiv.2007.08627,
title = {The signless Laplacian spectral radius of graphs with forbidding linear forests},
author = {Ming-Zhu Chen and A-Ming Liu and Xiao-Dong Zhang},
journal= {arXiv preprint arXiv:2007.08627},
year = {2020}
}
Comments
14 pagew, 2 figures. arXiv admin note: text overlap with arXiv:1801.06763