arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.00963math.CO
收藏

关于图的最小度数为k-奇因子临界图的一些充分条件

Some sufficient conditions for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors

Jiangsu Normal University(江苏师范大学)

Jiaxu Zhong, Yong Lu

AI总结:

本文基于距离谱半径和距离无符号拉普拉斯谱半径,研究了图的最小度数为k-奇因子临界图的充分条件。

摘要:

一个图G被称为k-因子临界图,如果对于每个子集S⊆V(G),且|S|=k,G-S都有一个完美匹配。图G的生成子图H被称为[1,b]-奇因子,如果b≡1 mod 2,并且对于每个v∈V(G),d_H(v)∈{1,3,…,b}。此外,G被称为关于[1,b]-奇因子的k-临界图,如果对于每个子集X⊆V(G),且|X|=k,G-X包含一个[1,b]-奇因子。在本文中,我们基于距离谱半径和距离无符号拉普拉斯谱半径,提供了一些充分条件,以确保具有最小度数的图成为关于[1,b]-奇因子的k-临界图。

英文摘要:

A graph $G$ is $k$-factor-critical if $G-S$ has a perfect matching for every subset $S \subseteq V(G)$ with $|S|=k$. A spanning subgraph $H$ of $G$ is called a $[1,b]$-odd factor if $b \equiv 1 \pmod{2}$ and $d_{H}(v) \in\left\lbrace 1, 3, \ldots, b\right\rbrace$ for every $v\in V(G),$ where $d_{H}(v)$ denotes the degree of vertex $v$ in $H$. Moreover, $G$ is said to be $k$-critical with respect to $[1,b]$-odd factors if $G-X$ contains a $[1,b]$-odd factor for every subset $X \subseteq V(G)$ with $|X|=k$. In this paper, we provide some sufficient conditions based on the distance spectral radius and the distance signless Laplacian spectral radius for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors.

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

↑