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

DOI10.1007/s10998-012-2174-7zbMath1299.05253OpenAlexW2064274877WikidataQ57974348 ScholiaQ57974348MaRDI QIDQ2454593

Magdalena Lemańska, Ismael González Yero, Juan Alberto Rodríguez-Velázquez

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

zbMATH Keywords

Nordhaus-Gaddum resultsconvex domination number

Mathematics Subject Classification ID

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

Related Items (3)

Convex and isometric domination of (weak) dominating pair graphs ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

Cites Work

• A note on the weakly convex and convex domination numbers of a torus
• Restrained domination in graphs
• Nordhaus-Gaddum inequalities for domination in graphs
• A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type
• Nordhaus-Gaddum results for weakly convex domination number of a graph
• On Complementary Graphs
• Graphs with convex domination number close to their order
• Total domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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