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

图和二部图的完美匹配与距离谱半径

Perfect matching and distance spectral radius in graphs and bipartite graphs

Yuke Zhang, Huiqiu Lin

摘要:

图$G$中的完美匹配是覆盖$G$的每个顶点的不相邻边的集合。基于图的特征值与匹配数之间关系的最新研究进展,本文提出了一个距离谱半径条件来保证图的完美匹配.设$G$是一个$n$ -顶点连通图,其中$n$是偶数,$λ_{1}(D(G))$是$G$的距离谱半径.那么下面的陈述是正确的。\noindent $\rm{I)}$如果$4\le n\le10$和${λ}_{1} (D\left(G\right))\le {λ}_{1} (D(S_{n,{\frac{n}{2}}-1}))$,则$G$包含完美匹配,除非$G\cong S_{n,{\frac{n}{2}-1}}$其中$S_{n,{\frac{n}{2}-1}}\cong K_{{\frac{n}{2}-1}}\vee ({\frac{n}{2}+1})K_1$。\noindent $\rm{II)}$如果$n\ge 12$和${λ}_{1} (D\left(G\right))\le {λ}_{1} (D(G^*))$,则$G$包含完美匹配,除非$G\cong G^*$其中$G^*\cong K_1\vee (K_{n-3}\cup2K_1)$。此外,如果$G$是具有$λ_{1}(D(G))\le λ_{1}(D(B_{n-1,n-2})) $的连通$2n$ -顶点平衡二部图,则$G$包含完美匹配,除非是$G\cong B_{n-1,n-2}$,其中$B_{n-1,n-2}$是通过将两个悬垂顶点附加到$n$ -顶点部分中的顶点而从$K_{n,n-2}$获得的。

英文摘要:

A perfect matching in a graph $G$ is a set of nonadjacent edges covering every vertex of $G$. Motivated by recent progress on the relations between the eigenvalues and the matching number of a graph, in this paper, we aim to present a distance spectral radius condition to guarantee the existence of a perfect matching. Let $G$ be an $n$-vertex connected graph where $n$ is even and $λ_{1}(D(G))$ be the distance spectral radius of $G$. Then the following statements are true. \noindent$\rm{I)}$ If $4\le n\le10$ and ${λ}_{1} (D\left(G\right))\le {λ}_{1} (D(S_{n,{\frac{n}{2}}-1}))$, then $G$ contains a perfect matching unless $G\cong S_{n,{\frac{n}{2}-1}}$ where $S_{n,{\frac{n}{2}-1}}\cong K_{{\frac{n}{2}-1}}\vee ({\frac{n}{2}+1})K_1$. \noindent$\rm{II)}$ If $n\ge 12$ and ${λ}_{1} (D\left(G\right))\le {λ}_{1} (D(G^*))$, then $G$ contains a perfect matching unless $G\cong G^*$ where $G^*\cong K_1\vee (K_{n-3}\cup2K_1)$. Moreover, if $G$ is a connected $2n$-vertex balanced bipartite graph with $λ_{1}(D(G))\le λ_{1}(D(B_{n-1,n-2})) $, then $G$ contains a perfect matching, unless $G\cong B_{n-1,n-2}$ where $B_{n-1,n-2}$ is obtained from $K_{n,n-2}$ by attaching two pendent vertices to a vertex in the $n$-vertex part.

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

↑