3 papers
math.CO2026
Approximation algorithms and ratios for multiple domination in graphs
Lukas Dijkstra, Vadim Zverovich, Andrei Gagarin
We analyse approximation algorithms (greedy heuristics) for the classical domination number and two multiple domination numbers in simple graphs. First, we present a short self-con…
math.CO2026
A Characterization of -Free Irredundance Perfect Graphs
Vadim Zverovich, Pavel Skums, Lutz Volkmann
Let and be the irredundance number and the domination number of a graph , respectively. A graph is called irredundance perfect if for every ind…
math.CO2026
On Camby-Plein's Characterization of Domination Perfect Graphs
Vadim Zverovich
We show that all results stated in [E. Camby, F. Plein, Discrete Appl. Math. 217 (2017) 711-717] are either previously known or incorrect. For example, Camby and Plein claimed to p…