scientific article; zbMATH DE number 2204178

MaRDI QIDQ5315867zbMATH OpenFDO

Authors Magdalena Lemańska

Publication date 12 September 2005

Mathematics Subject Classification ID

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

Recommendations

• On the connected and weakly convex domination numbers
• Outer-weakly convex domination number of graphs
• Weakly convex and convex domination numbers of some products of graphs.
• Weakly convex domination subdivision number of a graph
• The convex and weak convex domination number of convex polytopes

Cited in

(15)

• Convex and isometric domination of (weak) dominating pair graphs
• A centrality notion for graphs based on Tukey depth
• Convex dominating sets in maximal outerplanar graphs
• Nordhaus-Gaddum results for the convex domination number of a graph
• On minimal geodetic domination in graphs
• Weakly convex and convex domination numbers of some products of graphs.
• Weakly convex and weakly connected independent dominations in the corona of graphs
• Convex domination in the composition and Cartesian product of graphs.
• Outer-weakly convex domination number of graphs
• On the connected and weakly convex domination numbers
• Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
• The convex and weak convex domination number of convex polytopes
• Outer-convex domination in graphs
• Domination-related parameters in rooted product graphs
• Towards a new framework for domination

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315867)