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

DOI10.1007/S10998-012-2174-7MaRDI QIDQ2454593zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

Nordhaus-Gaddum resultsconvex domination number

Mathematics Subject Classification ID

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

Recommendations

• Graphs with convex domination number close to their order
• The convex domination subdivision number of a graph
• A note on the weakly convex and convex domination numbers of a torus
• Convex dominating-geodetic partitions in graphs
• Weakly convex and convex domination numbers of some products of graphs.

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1792607 (Why is no real title available?)
• scientific article; zbMATH DE number 2204178 (Why is no real title available?)
• scientific article; zbMATH DE number 3358515 (Why is no real title available?)
• 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
• Graphs with convex domination number close to their order
• Nordhaus-Gaddum inequalities for domination in graphs
• Nordhaus-Gaddum results for weakly convex domination number of a graph
• On Complementary Graphs
• Restrained domination in graphs
• Total domination in graphs

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
• scientific article; zbMATH DE number 2188609 (Why is no real title available?)
• Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers
• Convex dominating-geodetic partitions in graphs
• 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)