English

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

Combinatorics 2023-05-26 v1

Abstract

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

Keywords

Cite

@article{arxiv.2305.16108,
  title  = {A spectral radius condition for a graph to have $(a,b)$-parity factors},
  author = {Junjie Wang and Yang Yu and Jianbiao Hu and Peng Wen},
  journal= {arXiv preprint arXiv:2305.16108},
  year   = {2023}
}

Comments

12 pages