结合图中存在 $H_b$-因子的谱半径条件
Spectral radius for the existence of $H_b$-factors in binding graphs
AI总结:
本文利用谱半径给出了一个连通 $\frac{1}{b-1}$-结合图存在 $H_b$-因子的充分条件。
摘要:
图 $G$ 的结合数 $\mbox{bind}(G)$ 定义为 $\frac{|N_G(X)|}{|X|}$ 的最小值,其中 $X$ 是 $V(G)$ 的任意非空子集且 $N_G(X)\neq V(G)$。若 $\mbox{bind}(G)\geq r$,则称图 $G$ 是 $r$-结合的。图 $G$ 的邻接矩阵记为 $A(G)$,$A(G)$ 的最大特征值称为 $G$ 的谱半径。图 $G$ 的 $H_b$-因子定义为 $G$ 的一个生成子图 $F$,使得对任意 $v\in V(G)$,$d_F(v)$ 属于集合 $\{1,3,5,\ldots,b-1,b\}$,其中 $b$ 是满足 $b\geq2$ 的偶数。本文基于谱半径建立了一个充分条件,保证偶数阶连通 $\frac{1}{b-1}$-结合图 $G$ 包含 $H_b$-因子。
英文摘要:
The binding number, denoted by $\mbox{bind}(G)$, of a graph $G$ is defined as the minimum value of $\frac{|N_G(X)|}{|X|}$ taken over any non-empty subset $X$ of $V(G)$ with $N_G(X)\neq V(G)$. A graph $G$ is said to be $r$-binding if $\mbox{bind}(G)\geq r$. The adjacency matrix of a graph $G$ is denoted by $A(G)$. The largest eigenvalue of $A(G)$ is called the spectral radius of $G$. An $H_b$-factor of a graph $G$ is defined as a spanning subgraph $F$ of $G$ such that for any $v\in V(G)$, $d_F(v)$ belongs to the set $\{1,3,5,\ldots,b-1,b\}$, where $b$ is an even integer with $b\geq2$. This note establishes a sufficient condition to guarantee that a connected $\frac{1}{b-1}$-binding graph $G$ of even order contains an $H_b$-factor based on the spectral radius.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。