Independent and total domination in antiprism graphs from convex polytopes
Mathematics Open · 2026-01 · 05
DOI: 10.1142/s2811007226500069 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics Open, online erschienen am 07.04.2026. Verfasst von Nasir Ali und 6 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Ali, N., Arasu, R., Parvathi, N., Marimuthu, K., Qureshi, M. I., Siddiqui, H. M. A., & Smerat, A. (2026). Independent and total domination in antiprism graphs from convex polytopes. Mathematics Open, 05. https://doi.org/10.1142/s2811007226500069
Vancouver
Ali N, Arasu R, Parvathi N, Marimuthu K, Qureshi MI, Siddiqui HMA, et al. Independent and total domination in antiprism graphs from convex polytopes. Mathematics Open. 2026;05. doi:10.1142/s2811007226500069
BibTeX
@article{Ali2026,
author = {Ali, Nasir and Arasu, R. and Parvathi, N. and Marimuthu, K. and Qureshi, Muhammad Imran and Siddiqui, Hafiz Muhammad Afzal and Smerat, Aseel},
title = {Independent and total domination in antiprism graphs from convex polytopes},
journal = {Mathematics Open},
year = {2026},
volume = {05},
doi = {10.1142/s2811007226500069}
}
EUVIMED