Year: 2025
Type: article
Abstract: In this paper, we characterize the connected total dominating sets (CTDS) in graphs resulting from uniform network interactions. Moreover, we establish the polynomial representation of the resulting graph with respect to its CTDS and neighborhood systems. We have shown that the polynomial can be expressed as the product of a binomial expansion and exponential form.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4411772554
