In this paper, we further study the concepts of hop domination and 2-step domination and introduce the concepts of restrained hop domination, total restrained hop domination, 2-step restrained domination, and total 2-step restrained domination in graphs. We then construct integer programming formulations and present probabilistic upper bounds for these domination parameters.
Cite
@article{arxiv.2311.06490,
title = {Integer Programming Formulations and Probabilistic Bounds for Some Domination Parameters},
author = {Mhelmar A. Labendia and Clifford R. Pornia},
journal= {arXiv preprint arXiv:2311.06490},
year = {2023}
}