Nordhaus-Gaddum results for the convex domination number of a graph
DOI10.1007/S10998-012-2174-7zbMATH Open1299.05253OpenAlexW2064274877WikidataQ57974348 ScholiaQ57974348MaRDI QIDQ2454593FDOQ2454593
Authors: Magdalena Lemańska, Juan A. Rodríguez-Velázquez, Ismael G. Yero 
Publication date: 13 June 2014
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-012-2174-7
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Total domination in graphs
- Restrained domination in graphs
- Title not available (Why is that?)
- On Complementary Graphs
- Title not available (Why is that?)
- Nordhaus-Gaddum inequalities for domination in graphs
- Graphs with convex domination number close to their order
- A note on the weakly convex and convex domination numbers of a torus
- A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
- Nordhaus-Gaddum results for weakly convex domination number of a graph
- Title not available (Why is that?)
Cited In (9)
- Graphs with convex domination number close to their order
- 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?)
- Convex dominating-geodetic partitions in graphs
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers
- A note on the weakly convex and convex domination numbers of a torus
- Toward a Nordhaus-Gaddum inequality for the number of dominating sets
- Convex dominating sets in maximal outerplanar graphs
This page was built for publication: Nordhaus-Gaddum results for the 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 Q2454593)
