图的ID-因子临界与分数[a, b]-因子的距离谱条件
Distance spectral conditions for $ID$-factor-critical and fractional $[a, b]$-factor of graphs
AI总结:
本文研究图的距离谱条件,给出保证图具有ID-因子临界性的距离谱半径条件,并建立分数[a, b]-因子、分数[a, b]-可删因子及k-因子存在的充分谱条件。
摘要:
设G=(V(G), E(G))是一个以V(G)为顶点集、E(G)为边集的图。若对于G的任意一个大小与|V(G)|具有相同奇偶性的独立集I,G-I都有完美匹配,则称该图是ID-因子临界的。对于满足a≤b的两个正整数a和b,设h: E(G)→[0, 1]是定义在E(G)上的函数,且对任意顶点v_i∈V(G)满足a≤∑_{e∈E_G(v_i)}h(e)≤b。则以边集E_h为边集的生成子图G[E_h]称为G的具有指示函数h的分数[a, b]-因子,其中E_h={e∈E(G) | h(e)>0},E_G(v_i)={e∈E(G) | e在G中与v_i关联}。若对任意e∈E(G),G-e都包含一个分数[a, b]-因子,则称该图为分数[a, b]-可删图。对任意整数k≥1,若图包含一个k-正则生成子图,则称该图具有k-因子。本文首先给出保证G是ID-因子临界的距离谱半径条件。进一步,我们以距离谱半径和无符号距离拉普拉斯谱半径的形式,提供了图包含分数[a, b]-因子、分数[a, b]-可删因子以及k-因子的充分条件。
英文摘要:
Let $G=(V(G), E(G))$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A graph is $ID$-factor-critical if for every independent set $I$ of $G$ whose size has the same parity as $|V(G)|$, $G-I$ has a perfect matching. For two positive integers $a$ and $b$ with $a\leq b$, let $h$: $E(G)\rightarrow [0, 1]$ be a function on $E(G)$ satisfying $a\leq\sum _{e\in E_{G}(v_{i})}h(e)\leq b$ for any vertex $v_{i}\in V(G)$. Then the spanning subgraph with edge set $E_{h}$, denoted by $G[E_{h}]$, is called a fractional $[a, b]$-factor of $G$ with indicator function $h$, where $E_{h}=\{e\in E(G)\mid h(e)>0\}$ and $E_{G}(v_{i})=\{e\in E(G)\mid e$ is incident with $v_{i}$ in $G$\}. A graph is defined as a fractional $[a, b]$-deleted graph if for any $e\in E(G)$, $G-e$ contains a fractional $[a, b]$-factor. For any integer $k\geq 1$, a graph has a $k$-factor if it contains a $k$-regular spanning subgraph. In this paper, we firstly give a distance spectral radius condition of $G$ to guarantee that $G$ is $ID$-factor-critical. Furthermore, we provide sufficient conditions in terms of distance spectral radius and distance signless Laplacian spectral radius for a graph to contain a fractional $[a, b]$-factor, fractional $[a, b]$-deleted-factor and $k$-factor.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。