Computing the Secure Domination Number of Poset Graphs of Semigroups and Its Python Implementation
Journal of Mathematics · 2026-01 · 2026 (1)
DOI: 10.1155/jom/5864542 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Mathematics, online erschienen am 14.11.2026. Verfasst von Muhammad Ahsan Binyamin und 4 weiteren Autor:innen. Die Arbeit nennt 11 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Princess Nourah Bint Abdulrahman University.
Abstract (Originalsprache)
A secure dominating set of a graph G is a dominating set D ⊆ V ( G ) with the property that for each u ∉ D , there is v ∈ N ( u )∩ D such that (( D \{ v }) ∪ { u }) is dominating. The minimum cardinality of such D is called the secure domination number of G , denoted by γ s ( G ). In this article, the secure dominating set and the secure domination number for poset graphs of various families of numerical semigroups have been computed. Moreover, we develop a systematic algorithm for finding these invariants of poset graphs and present its implementation in Python.
Förderung
- Princess Nourah Bint Abdulrahman University
Zitieren
APA
Binyamin, M. A., Hadia, Alali, A. S., Siddig, N. H., & Rezk, E. G. (2026). Computing the Secure Domination Number of Poset Graphs of Semigroups and Its Python Implementation. Journal of Mathematics, 2026(1). https://doi.org/10.1155/jom/5864542
Vancouver
Binyamin MA, Hadia, Alali AS, Siddig NH, Rezk EG. Computing the Secure Domination Number of Poset Graphs of Semigroups and Its Python Implementation. Journal of Mathematics. 2026;2026(1). doi:10.1155/jom/5864542
BibTeX
@article{Binyamin2026,
author = {Binyamin, Muhammad Ahsan and Hadia and Alali, Amal S. and Siddig, Nawal H. and Rezk, Eman Ghareeb},
title = {Computing the Secure Domination Number of Poset Graphs of Semigroups and Its Python Implementation},
journal = {Journal of Mathematics},
year = {2026},
volume = {2026},
number = {1},
doi = {10.1155/jom/5864542}
}
EUVIMED