Graphs with convex domination number close to their order

DOI10.7151/dmgt.1322zbMath1140.05302OpenAlexW2089729116MaRDI QIDQ3508846

Joanna Cyman, Joanna Raczek, Magdalena Lemańska

Publication date: 1 July 2008

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

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

zbMATH Keywords

Cartesian productconvex domination

Mathematics Subject Classification ID

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

Related Items (5)

A note on the weakly convex and convex domination numbers of a torus ⋮ The convex and weak convex domination number of convex polytopes ⋮ Nordhaus-Gaddum results for the convex domination number of a graph ⋮ Convex dominating sets in maximal outerplanar graphs ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

This page was built for publication: Graphs with convex domination number close to their order