A conjectured bound linking the saturation number, maximum degree, and independent domination number of a connected graph.
-
Updated
Aug 5, 2026 - Python
A conjectured bound linking the saturation number, maximum degree, and independent domination number of a connected graph.
To associate your repository with the saturation-number topic, visit your repo's landing page and select "manage topics."