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

分数ID -[a,b]-因子-临界图的一个邻域条件

A neighborhood condition for fractional ID-[a,b]-factor-critical graphs

Sizhong Zhou, Fan Yang, Zhiren Sun

摘要:

设$G$是一个阶为$n$的图,$a$和$b$是两个具有$1\leq a\leq b$的整数.设$h: E(G)\rightarrow [0,1]$为函数。如果$a\leq\sum_{e\ni x}h(e)\leq b$对任何$x\in V(G)$成立,则我们称$G[F_h]$为具有指示函数$h$的$G$的分数$[a,b]$ -因子,其中$F_h=\{e\in E(G): h(e)>0\}$。一个图$G$是分数独立集可删除的$[a,b]$ -因子临界的(简称分数ID-$[a,b]$-因子临界的),如果$G-I$对于$G$的每个独立集$I$都有一个分数$[a,b]$ -因子。本文证明了:如果对任意两个不相邻的顶点$x,y\in V(G)$,$n\geq\frac{(a+2b)(2a+2b-3)+1}{b}$,$δ(G)\geq\frac{bn}{a+2b}+a$和$|N_G(x)\cup N_G(y)|\geq\frac{(a+b)n}{a+2b}$,则$G$是分数ID-$[a,b]$-因子临界的.此外,它表明,这一结果是最好的可能在某种意义上。

英文摘要:

Let $G$ be a graph of order $n$, and let $a$ and $b$ be two integers with $1\leq a\leq b$. Let $h: E(G)\rightarrow [0,1]$ be a function. If $a\leq\sum_{e\ni x}h(e)\leq b$ holds for any $x\in V(G)$, then we call $G[F_h]$ a fractional $[a,b]$-factor of $G$ with indicator function $h$ where $F_h=\{e\in E(G): h(e)>0\}$. A graph $G$ is fractional independent-set-deletable $[a,b]$-factor-critical (in short, fractional ID-$[a,b]$-factor-critical) if $G-I$ has a fractional $[a,b]$-factor for every independent set $I$ of $G$. In this paper, it is proved that if $n\geq\frac{(a+2b)(2a+2b-3)+1}{b}$, $δ(G)\geq\frac{bn}{a+2b}+a$ and $|N_G(x)\cup N_G(y)|\geq\frac{(a+b)n}{a+2b}$ for any two nonadjacent vertices $x,y\in V(G)$, then $G$ is fractional ID-$[a,b]$-factor-critical. Furthermore, it is shown that this result is best possible in some sense.

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

↑