3 papers
math.CO2026
Signed Total Roman Domination and Domatic Numbers: Degree Three and Complete Multipartite Graphs
Arie M. C. A. Koster, Lutz Volkmann, Moritz Wehrmann
Signed total Roman domination is a variant of the classic Roman domination-problem in graphs. A signed total Roman dominating function (STRD function) on a graph is a fun…
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.CO2025
On the total Italian domination number in digraphs
Changchang Dong, Yubao Guo, Mei Lu +1
Consider a finite simple digraph with vertex set . An Italian dominating function (IDF) on is a function satisfying every vertex with…