Spectral extrema of graphs: Forbidden star-path forests

2023/02/23 by Yanni Zhai, Xiying Yuan, Zhai, Yanni +3 · 1 citation
Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Lignin and Wood Chemistry

paper · pdf · doi:10.48550/arxiv.2302.11839

openalex publication_date 2023/02/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A path of order n is denoted by P_n, and a star of order n is denoted by S_n-1. A star-path forest is a forest whose connected components are paths and stars. In this paper we determine the maximum spectral radius of graphs that contain no copy of kS_ℓ-1∪ P_ℓ, k₁S_{2ℓ -1}∪ k₂P_2ℓ or kS₄∪ 2P₅ for n appropriately large.

Cited by

• Spectral extremal problems for degenerate graphs

Related

• Spectral extrema of \K_k+1,L_s\-free graphs
• Spectral extremal results with forbidding linear forests
• Spectral extremal graphs for edge blow-up of star forests
• Spectral Radius of Graphs with Size Constraints: Resolving a Conjecture of Guiduli
• The bipartite Turan number and spectral extremum for linear forests