On the connected and weakly convex domination numbers
Combinatorics
2019-02-21 v1
Abstract
In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we prove that the weakly convex domination number is an interpolating function.
Keywords
Cite
@article{arxiv.1902.07505,
title = {On the connected and weakly convex domination numbers},
author = {Magda Dettlaff and Magdalena Lemańska and Dorota Osula and María José Souto-Salorio},
journal= {arXiv preprint arXiv:1902.07505},
year = {2019}
}
Comments
14 pages, 8 figures