Abstract: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.
From: Sufang Wang [view email]
[v1]
Tue, 23 Jun 2026 10:41:03 UTC (7 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。