Algebraic Representation of CTDS Over Uniform Network Interactions
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.
Authors
- Rosalio G. Artes
- Cerina Villarta
- Venerando Tenio
- Milani Udal
- Angelito Rendiza
Publication Details
- Journal
- International journal of mathematics and computer science
- Published
- 2025-01-01
- DOI
- https://doi.org/10.69793/ijmcs/03.2025/avtur
- Primary Topic
- Advanced Database Systems and Queries
- Type
- article
- Field-Weighted Citation Impact
- 0.00