The signless Laplacian spectral radius of graphs with forbidding linear forests

From MaRDI portal
Publication:2174499



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 kcdotP3 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 kcdotP3 as a subgraph, respectively.












This page was built for publication: The signless Laplacian spectral radius of graphs with forbidding linear forests

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