On Connected Secure Domination Polynomial of Some Graphs
Annals of Communications in Mathematics Β· 17.06.2026
DOI: 10.62072/acm.2026.09025 βKurz gefasst
Fachartikel in der Zeitschrift Annals of Communications in Mathematics, online erschienen am 17.06.2026. Verfasst von Jason D. Andoyo und 1 weiteren Autor:innen.
Abstract (Originalsprache)
A set π β π(πΊ) of the connected graph πΊ = (π(πΊ), πΈ(πΊ)) is said to be a connected secure dominating set if π is a dominating set, π is a secure set, and β¨πβ©πΊ is a connected graph. The connected secure domination polynomial of πΊ is π·π π (πΊ, π₯) = Ξ£ππ =πΎ π π (πΊ) ππ π (πΊ, π)π₯π where πΎ π π (πΊ) = min{|π| βΆ π is a connected secure dominating set of πΊ} and ππ π (πΊ, π) is the number of connected secure dominating sets with cardinality π. In this paper, we will determine the connected secure domination polynomial of path graph ππ, cycle graph πΆπ, complete graph πΎπ, star graph πΎ1,π, and corona graph πΊ β¦ πΎ1.
Zitieren
APA
Andoyo, J. D., & Rulete, R. F. (2026). On Connected Secure Domination Polynomial of Some Graphs. Annals of Communications in Mathematics. https://doi.org/10.62072/acm.2026.09025
Vancouver
Andoyo JD, Rulete RF. On Connected Secure Domination Polynomial of Some Graphs. Annals of Communications in Mathematics. 2026. doi:10.62072/acm.2026.09025
BibTeX
@article{Andoyo2026,
author = {Andoyo, Jason D. and Rulete, Ricky F.},
title = {On Connected Secure Domination Polynomial of Some Graphs},
journal = {Annals of Communications in Mathematics},
year = {2026},
doi = {10.62072/acm.2026.09025}
}
EUVIMED