|国家预印本平台
首页|Ordinary and spectral extremal problems on vertex disjoint copies of even fans

Ordinary and spectral extremal problems on vertex disjoint copies of even fans

Ordinary and spectral extremal problems on vertex disjoint copies of even fans

来源:Arxiv_logoArxiv
英文摘要

Let $\mathrm{ex}(n, F)$ and $\mathrm{spex}(n, F)$ be the maximum size and spectral radius among all $F$-free graphs with fixed order $n$, respectively. A fan is a graph $P_1\vee P_{s}$ (join of a vertex and a path of order $s$) for $s\ge 3$, and it is called an even fan if $s$ is even. In this paper, we study $\mathrm{ex}(n,t(P_1\vee P_{2k}))$, $\mathrm{spex}(n,t(P_1\vee P_{2k}))$ with $t\ge 1$ and $k\ge 3$ and characterize the corresponding extremal graphs for sufficiently large $n$.

Yiting Cai、Bo Zhou

数学

Yiting Cai,Bo Zhou.Ordinary and spectral extremal problems on vertex disjoint copies of even fans[EB/OL].(2025-05-14)[2025-06-07].https://arxiv.org/abs/2505.09183.点此复制

评论