Photo by lukechesser from unsplash
Abstract Turan type extremal problem is how to maximize the number of edges over all graphs which do not contain fixed forbidden subgraphs. Similarly, spectral Turan type extremal problem is… Click to show full abstract
Abstract Turan type extremal problem is how to maximize the number of edges over all graphs which do not contain fixed forbidden subgraphs. Similarly, spectral Turan 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 k ⋅ P 3 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 k ⋅ P 3 as a subgraph, respectively.
Journal Title: Linear Algebra and its Applications
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!