EUVIMEDEUVIMED entdecken
Crossref

On Connected Secure Domination Polynomial of Some Graphs

Jason D. Andoyo, Ricky F. Rulete

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.

AbstractBibliografische AngabenZitierenVerwandte Studien

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}
}
Kostenlos starten β†’