The convex and weak convex domination number of convex polytopes

• Zoran Lj. Maksimović ^[2] ; Aleksandar Lj. Savić ^[1] ; Milena S. Bogdanović ^[3]
  1. [1] University of Belgrade

     University of Belgrade

     Serbia

     
  2. [2] University of Defence de Belgrade, Serbia
  3. [3] Metropolitan University de Belgrado, Serbia

  Mostrar afiliaciones +
• Localización: Revista de la Unión Matemática Argentina, ISSN 0041-6932, ISSN-e 1669-9637, Vol. 63, Nº. 1, 2022, págs. 51-68
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • This paper is devoted to solving the weakly convex dominating set problem and the convex dominating set problem for some classes of planar graphs—convex polytopes. We consider all classes of convex polytopes known from the literature and present exact values of weakly convex and convex domination number for all classes, namely An, Bn, Cn, Dn, En, Rn, Rn, Qn,Sn, Sn, Tn, Tn and Un. When n is up to 26, the values are confirmed by using the exact method, while for greater values of n theoretical proofs are given.