The convex and weak convex domination number of convex polytopes

DOI10.33044/revuma.1739zbMath1496.05131OpenAlexW4220955732MaRDI QIDQ5101858

Milena Bogdanović, Aleksandar Savić, Zoran Maksimović

Publication date: 2 September 2022

Published in: Revista de la Unión Matemática Argentina (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33044/revuma.1739

zbMATH Keywords

convex polytopesweakly convex dominating set problem

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On classes of regular graphs with constant metric dimension
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• On families of convex polytopes with constant metric dimension
• On isometric subgraphs of infinite bridged graphs and geodesic convexity
• Convex universal fixers
• Graphs with convex domination number close to their order
• Convex domination in the composition and cartesian product of graphs

This page was built for publication: The convex and weak convex domination number of convex polytopes