加载中…
Let and be the maximum size and spectral radius among all -free graphs with fixed order , respectively. A fan is a graph (join of a vertex and a path of order ) for , and it is called an even fan if is even. In this paper, we study , with and and characterize the corresponding extremal graphs for sufficiently large .

生成讲解博客的中文版本

生成AI智能校验的中文版本