The convex and weak convex domination number of convex polytopes
DOI:
https://doi.org/10.33044/revuma.1739Abstract
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 $A_n$, $B_n$, $C_n$, $D_n$, $E_n$, $R_n$, $R''_n$, $Q_n$, $S_n$, $S''_n$, $T_n$, $T''_n$ and $U_n$. 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.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2022 Zoran Lj. Maksimović, Aleksandar Lj. Savić, Milena S. Bogdanović

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal. The Journal may retract the paper after publication if clear evidence is found that the findings are unreliable as a result of misconduct or honest error.