arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2606.22006math.CO
收藏

某些图并的饱和数

Saturation numbers of some joins of graphs

School of Mathematics, Hunan University(湖南大学数学学院)

Xinying Hua, Yuejian Peng

AI总结:

研究当F包含孤立顶点时,图K_1∨F的饱和数,并确定了F=K_3^-∪sK_1(s≥1)和F=K_{p-1}^-∪K_1(p≥5)时的精确值。

摘要:

设$H$是一个图。图$G$称为$H$-饱和的,如果$G$是$H$-自由的,但添加$G$中任意两个非相邻顶点之间的边都会产生一个$H$副本作为子图。饱和数$\mathrm{sat}(n, H)$是$n$个顶点上$H$-饱和图的最小边数。顶点与图$F$的并(记为$K_1\vee F$)的饱和数引起了广泛关注。Cameron和Puleo \cite{Ca}证明了对于$n > |V(F)|$,有$\mathrm{sat}(n,K_1 \vee F)\le n-1+\mathrm{sat}(n-1, F)$。一个自然的问题是上述等式何时成立。现有结果大多对$F$施加条件,并假设$F$没有孤立顶点。设$K_p^-$是从完全图$K_p$中删除一条边得到的图。本文研究了当$F$包含孤立顶点时$K_1\vee F$的饱和数,并确定了当$F=K^-_{3}\cup sK_1(s\ge 1)$或$F=K^-_{p-1}\cup K_1(p\ge 5)$时$\mathrm{sat}(n, K_1\vee F)$的精确值。

英文摘要:

Let $H$ be a graph. A graph $G$ is $H$-saturated if $G$ is $H$-free, but adding any edge between two non-adjacent vertices of $G$ yields an $H$-copy as a subgraph. The saturation number $\mathrm{sat}(n, H)$ is the minimum number of edges in an $H$-saturated graph on $n$ vertices. The saturation number for the join of a vertex and a graph $F$, denoted by $K_1\vee F$, has attracted considerable attention. Cameron and Puleo [Discrete Math. 345 (2022), 112867] proved that $\mathrm{sat}(n,K_1 \vee F)\le n-1+\mathrm{sat}(n-1, F)$ for $n > |V(F)|$. A natural question is when the above equality holds. Most existing results impose conditions on $F$ and assume that $F$ has no isolated vertices. Let $K_p^-$ be the graph obtained by deleting one edge from the complete graph $K_p$. In this paper, we investigate the saturation number of $K_1\vee F$ when $F$ contains isolated vertices, and determine the exact value of $\mathrm{sat}(n, K_1\vee F)$ when $F=K^-_{3}\cup sK_1(s\ge 1)$ or $F=K^-_{p-1}\cup K_1(p\ge 5)$. In our results, $\mathrm{sat}(n,K_1 \vee F)= n-1+\mathrm{sat}(n-1, F)$ holds when $F=K^-_{3}\cup sK_1$ for any $s\ge 1$, but fails when $F=K^-_{p-1}\cup K_1$ for $p\ge 5$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑