arXiv Analytics

Sign in

arXiv:2305.16108 [math.CO]AbstractReferencesReviewsResources

A spectral radius condition for a graph to have $(a,b)$-parity factors

Junjie Wang, Yang Yu, Jianbiao Hu, Peng Wen

Published 2023-05-25Version 1

Let $a,b$ be two positive integers such that $a \le b$ and $a \equiv b$ (mod $2$). We say that a graph $G$ has an $(a,b)$-parity factor if $G$ has a spanning subgraph $F$ such that $d_{F}(v) \equiv b$ (mod $2$) and $a \le d_{F}(v) \le b$ for all $v \in V (G)$. In this paper, we provide a tight spectral radius condition for a graph to have $(a,b)$-parity factors.

Comments: 12 pages
Categories: math.CO
Subjects: 05C50
Related articles: Most relevant | Search more
arXiv:1301.7565 [math.CO] (Published 2013-01-31)
A Note On Edge Connectivity and Parity Factor
arXiv:math/0210208 [math.CO] (Published 2002-10-14, updated 2002-12-02)
A new family of positive integers
arXiv:1211.1606 [math.CO] (Published 2012-09-23, updated 2012-11-30)
On identities generated by compositions of positive integers