On the spectral radius of graphs without a gem (Q6589142)

A gem is the join of a path \(P_4\) and an isolated vertex, which can be seen as the 5-vertex graph consisting of a 4-vertex path plus a vertex adjacent to each vertex of the path. A graph is said to be gem-free if it does not contain a gem as a subgraph. In this paper, the author addresses the spectral extremal problem for gem-free graphs with a given size. The maximum spectral radius of gem-free graphs with size \(m \geq 11\) is obtained, and the corresponding extremal graph is identified. This is a nice paper. It will be invoked to address Problem 2 in the paper under review. In fact, Problem 2 was completely resolved (see [\textit{S. Li} et al., ``Spectral extrema of graphs with fixed size: forbidden fan graph, friendship graph or theta graph'', Preprint, \url{arXiv:2409.15918}]).