Some results on the k-strong parity property in a graph

TL;DR

This paper investigates conditions under which graphs possess the $k$-strong parity property, providing size and spectral radius criteria to identify such graphs, advancing understanding of graph factorization properties.

Contribution

It introduces a size condition and a spectral radius condition for a graph to have the $k$-strong parity property, extending previous characterizations.

Findings

Established a size threshold for the $k$-strong parity property.

Derived a signless Laplacian spectral radius condition for the property.

Enhanced theoretical understanding of graph factors related to parity.

Abstract

A graph $G$ has the $k$-strong parity property if for any $X\subseteq V(G)$ with $|X|$ even, $G$ contains a spanning subgraph $F$ with $d_F(u)\equiv1$ (mod 2) for each $u\in X$ and $d_F(v)\in\{k,k+2,k+4,\ldots\}$ for each $v\in V(G)\setminus X$, where $k\geq2$ is an even integer. Kano and Matsumura proposed a characterization for a graph with the $k$-strong parity property (M. Kano, H. Matsumura, Odd-even factors of graphs, Graphs Combin. 41 (2025) 55). In this paper, we first give a size condition for a graph to have the $k$-strong parity property. Then we establish a signless Laplacian spectral radius condition to guarantee that a graph has the $k$-strong parity property.