2019/02/20 by Magda Dettlaff, Magdalena Lemańska, Dettlaff, Magda +5
Computer Science · #05C05 #05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1902.07505
openalex publication_date 2019/02/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.