Toughness and (a,b)-parity factors in graphs | Synapse
September 29, 2025Open Access
Toughness and (a,b)-parity factors in graphs
Key Points
A toughness condition is established for the existence of (a,b)-parity factors in graphs.
The findings indicate that the results are sharp in certain scenarios.
Understanding this toughness condition enhances comprehension of graph structure.
These insights can be applied in various mathematical and computational contexts.
Abstract
In this paper, we consider (a,b)- parity factors in graphs and obtain a toughness condition for the existence of (a,b)-parity factors. Furthermore, we show that the result is sharp in some sense.