An odd $[1,b]$-factor in regular graphs from eigenvalues

Sungeun Kim, Suil O, Jihwan Park +1

An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for each vertex $v\in V(G)$, $d_H(v)$ is odd and $1\le d_H(v)\le b$. Let ${\lambda }_3(G)$ be the third largest e…