Independent and total domination in antiprism graphs from convex polytopes

Let [Formula: see text] be a connected graph. Antiprism graphs, defined as the skeletons of antiprism-shaped convex polytopes, consist of [Formula: see text] vertices and [Formula: see text] edges for an n-sided base. These graphs arise from convex polytopes, which are geometric structures formed as the convex hulls of finite point sets in Euclidean space [Formula: see text], preserving adjacency and incidence relations among vertices. Domination parameters such as the domination number [Formula: see text], independent domination number [Formula: see text], and total domination number [Formula: see text] provide valuable insights into the structural properties and complexity of such graphs. In this paper, we focus on two classes of graphs derived from convex polytopes, denoted by [Formula: see text] and [Formula: see text]. We determine explicit formulas for the independent domination number and the total domination number of these graph families. Furthermore, we characterize optimal dominating sets and establish precise relationships between the geometric structure of antiprism-based graphs and their domination parameters. These findings extend existing domination theory to convex polytope graphs and highlight the theoretical significance of the interplay between discrete geometry and graph-theoretic domination properties.