Nordhaus-Gaddum results for weakly convex domination number of a graph
From MaRDI portal
Publication:3059094
DOI10.7151/DMGT.1491zbMATH Open1214.05008OpenAlexW1981303882MaRDI QIDQ3059094FDOQ3059094
Authors: 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
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (6)
- Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
- Convex and isometric domination of (weak) dominating pair graphs
- Title not available (Why is that?)
- On dominating sets whose induced subgraphs have a bounded diameter
- Nordhaus-Gaddum results for the convex domination number of a graph
- Toward a Nordhaus-Gaddum inequality for the number of dominating sets
This page was built for publication: Nordhaus-Gaddum results for weakly convex domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059094)
