English

Spectral conditions for graphs having all (fractional) $[a,b]$-factors

Combinatorics 2023-02-08 v2

Abstract

Let aba\leq b be two positive integers. We say that a graph GG has all [a,b][a,b]-factors if it has an hh-factor for every function h:V(G)Z+h: V(G)\rightarrow \mathbb{Z}^+ such that ah(v)ba\le h(v) \le b for all vV(G)v\in V(G) and vV(G)h(v)0(mod2)\sum_{v\in V(G)}h(v)\equiv 0\pmod 2, and has all fractional [a,b][a,b]-factors if it has a fractional pp-factor for every p:V(G)Z+p: V(G) \rightarrow \mathbb{Z}^+ such that ap(v)ba\le p(v)\le b for all vV(G)v\in V(G). In this paper, we provide tight spectral radius conditions for graphs having all [a,b][a,b]-factors (3a<b3\leq a<b) and all fractional [a,b][a,b]-factors (1a<b1\leq a<b), respectively.

Keywords

Cite

@article{arxiv.2212.03622,
  title  = {Spectral conditions for graphs having all (fractional) $[a,b]$-factors},
  author = {Jiaxin Zheng and Junjie Wang and Xueyi Huang},
  journal= {arXiv preprint arXiv:2212.03622},
  year   = {2023}
}

Comments

15 pages