On Sharp Bounds of Fault-Tolerant Partition Dimension of Convex Polytopes
Graph theory is a fundamental and powerful tool for designing and modeling networks. It plays a vital role in diverse real-world systems, including social, computer, biological, ecological, and neural networks. Convex polytopes are convex sets of elements contained in the Euclidean space ℝ^n. They a...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Alexandru Ioan Cuza University of Iasi
2025-09-01
|
| Серии: | Scientific Annals of Computer Science |
| Предметы: | |
| Online-ссылка: | https://publications.info.uaic.ro/scientific-annals-of-computer-science/sacs-volumes/xxxv-2/on-sharp-bounds-of-fault-tolerant-partition-dimension-of-convex-polytopes/ |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|