EUVIMEDEUVIMED entdecken
Crossref

Enumeration of 2-factored dominating sets in fixed-width grid graphs

Moe Moe Oo, Natawat Klamsakul, Nuttanon Songsuwan, Pawaton Kaemawichanurat

Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 409-427

DOI: 10.61091/jcmcc131-19 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von Moe Moe Oo und 3 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A \(2\)-factored dominating set (\(2\)fd-set) of a graph \(G=(V,E)\) is a dominating set \(F\subseteq V\) such that the induced subgraph \(G[F]\) is \(2\)-regular, and hence is a disjoint union of cycles. In this study, \(2\)-factored dominating sets on fixed-width grid graphs of dimensions \(m \times n\), where \(m \in \{2,3,4\}\), are enumerated. We establish theorems describing the generating functions with respect to the number of \(2\)-factored dominating sets in these grid graphs. The number of \(2\)-factored dominating sets grows exponentially with \(n\), with growth constant determined by the dominant singularity of the generating function.

Zitieren

APA

Oo, M. M., Klamsakul, N., Songsuwan, N., & Kaemawichanurat, P. (2026). Enumeration of 2-factored dominating sets in fixed-width grid graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 409-427. https://doi.org/10.61091/jcmcc131-19

Vancouver

Oo MM, Klamsakul N, Songsuwan N, Kaemawichanurat P. Enumeration of 2-factored dominating sets in fixed-width grid graphs. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:409-427. doi:10.61091/jcmcc131-19

BibTeX
@article{Oo2026,
  author = {Oo, Moe Moe and Klamsakul, Natawat and Songsuwan, Nuttanon and Kaemawichanurat, Pawaton},
  title = {Enumeration of 2-factored dominating sets in fixed-width grid graphs},
  journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
  year = {2026},
  volume = {131},
  pages = {409--427},
  doi = {10.61091/jcmcc131-19}
}
Kostenlos starten →