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

图的分数因子、分支因子与孤立点条件

Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs

Mikio Kano, Hongliang Lu, Qinglin Yu

摘要:

对于图$G = (V, E)$,{ \em分数$[a, b]$ -因子}是对所有$ v\in V(G)$满足$a \le ~ \sum_{e\in E_G(v)} h(e) ~ \le b$的实值函数$h:E(G)\to [0,1]$,其中$a$和$b$是实数,并且$E_G(v)$表示与$v$关联的边的集合。本文证明了条件$\mathit{iso}(G-S) \le (k+\frac{1}{2})|S|$等价于分数$[1,k+ \frac{1}{2}]$ -因子的存在性,其中${\mathit{iso}}(G-S)$表示$G-S$中孤立点的个数.在给定的孤立条件下,利用分数因子作为工具,构造了分量因子。也就是说,(i)一个图$G$有一个$\{P_2,C_3,P_5, \mathcal{T}(3)\}$ -因子当且仅当$\mathit{iso}(G-S) \le \frac{3}{2}|S|$对所有$S\subset V(G)$ ;(ii)一个图$G$有一个$\{K_{1,1}, K_{1,2}, \ldots,$ $K_{1,k}, \mathcal{T}(2k+1)\}$ -因子($k\ge 2$)当且仅当$\mathit{iso}(G-S) \le (k+\frac{1}{2})|S|$对所有$S\subset V(G)$,其中$\mathcal{T}(3)$和$\mathcal{T}(2k+1)$是两个特殊的树族。

英文摘要:

For a graph $G = (V, E)$, a {\em fractional $[a, b]$-factor} is a real valued function $h:E(G)\to [0,1]$ that satisfies $a \le ~ \sum_{e\in E_G(v)} h(e) ~ \le b$ for all $ v\in V(G)$, where $a$ and $b$ are real numbers and $E_G(v)$ denotes the set of edges incident with $v$. In this paper, we prove that the condition $\mathit{iso}(G-S) \le (k+\frac{1}{2})|S|$ is equivalent to the existence of fractional $[1,k+ \frac{1}{2}]$-factors, where ${\mathit{iso}}(G-S)$ denotes the number of isolated vertices in $G-S$. Using fractional factors as a tool, we construct component factors under the given isolated conditions. Namely, (i) a graph $G$ has a $\{P_2,C_3,P_5, \mathcal{T}(3)\}$-factor if and only if $\mathit{iso}(G-S) \le \frac{3}{2}|S|$ for all $S\subset V(G)$; (ii) a graph $G$ has a $\{K_{1,1}, K_{1,2}, \ldots,$ $K_{1,k}, \mathcal{T}(2k+1)\}$-factor ($k\ge 2$) if and only if $\mathit{iso}(G-S) \le (k+\frac{1}{2})|S|$ for all $S\subset V(G)$, where $\mathcal{T}(3)$ and $\mathcal{T}(2k+1)$ are two special families of trees.

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

↑