Spectral Extremal Results with Forbidding Linear Forests
- 85 Downloads
The Turán type extremal problems ask to maximize the number of edges over all graphs which do not contain fixed subgraphs. Similarly, their spectral counterparts ask to maximize spectral radius of all graphs which do not contain fixed subgraphs. In this paper, we determine the maximum spectral radius of all graphs without a linear forest as a subgraph and all the extremal graphs. In addition, the maximum number of edges and spectral radius of all bipartite graphs without \(k\cdot P_3\) as a subgraph are obtained and all the extremal graphs are also determined. Moreover, some relations between Turán type extremal problems and their spectral counterparts are discussed.
KeywordsTurán type extremal problem Spectral counterparts Linear forest Spectral radius Bipartite graph
Mathematics Subject Classification05C50 05C35
The authors would like to thank the anonymous referee for many helpful and constructive suggestions to an earlier version of this paper, which results in an great improvement.