arXiv:2311.06490 Abstract | arXiv Analytics

arXiv:2311.06490 [math.CO]Abstract References Reviews Resources

Integer Programming Formulations and Probabilistic Bounds for Some Domination Parameters

Published 2023-11-11Version 1

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.

Categories: math.CO

Keywords: domination parameters, probabilistic bounds, restrained domination, probabilistic upper bounds, total restrained hop domination

Related articles: Most relevant | Search more

arXiv:1412.0515 [math.CO] (Published 2014-11-25)

$(k,k',k'')$-domination in graphs

Abdollah Khodkar, Babak Samadi, H. R. Golmohammadi

arXiv:1511.00410 [math.CO] (Published 2015-11-02)

Domination parameters with number 2

Flavia Bonomo, Bostjan Bresar, Luciano N. Grippo, Martin Milanic, Martin D. Safe

arXiv:1805.04038 [math.CO] (Published 2018-05-10)

Packing and domination parameters in digraphs

Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero