Nordhaus-Gaddum results for weakly convex domination number of a graph

DOI10.7151/dmgt.1491zbMath1214.05008OpenAlexW1981303882MaRDI QIDQ3059094

Magdalena Lemańska

Publication date: 8 December 2010

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a0b28e958b38d29897ebe8cece669b9ad5223268

zbMATH Keywords

Nordhaus-Gaddum resultsweakly convex domination number

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

On dominating sets whose induced subgraphs have a bounded diameter ⋮ Nordhaus-Gaddum results for the convex domination number of a graph ⋮ Convex and isometric domination of (weak) dominating pair graphs ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

This page was built for publication: Nordhaus-Gaddum results for weakly convex domination number of a graph