Can I read Sufficient Conditions for a Graph with Minimum Degree to Be K-critical with Respect to [1,B]-odd Factor on EtoBox?

Sufficient Conditions for a Graph with Minimum Degree to Be K-critical with Respect to [1,B]-odd Factor by Zhou, Sizhong is a scholarly article available to read on EtoBox.

What is Sufficient Conditions for a Graph with Minimum Degree to Be K-critical with Respect to [1,B]-odd Factor about?

A spanning subgraph $F$ of a graph $G$ is called a $[1,b]$-odd factor if $b\equiv1$ (mod 2) and $d_F(v)\in\{1,3,\ldots,b\}$ for every $v\in V(G)$. A graph $G$ of order $n\geq k+2$ is $k$-critical with respect to $[1,b]$-odd factor if for any $X\subseteq V(G)$ with $|X|=k$, $G-X$ has a $[1,b]$-odd factor. In this paper, we provide a size and spectral radius conditions for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factor, respectively.

Author

Zhou, Sizhong

Published

2025

Language

EN