Authors:M. Lemańska, J. Rodríguez-Velázquez and I. Gonzalez Yero
The distance dG(u, v) between two vertices u and v in a connected graph G is the length of the shortest uv-path in G. A uv-path of length dG(u, v) is called a uv-geodesic. A set X is convex in G if vertices from all ab-geodesics belong to X for any two vertices a, b ∈ X. The convex domination number γcon(G) of a graph G equals the minimum cardinality of a convex dominating set. In the paper, Nordhaus-Gaddum-type results for the convex domination
number are studied.