Year: 2026
Type: article
Abstract: Let be a connected noncomplete graph with at least 3 vertices. Then an independent set that dominates , in which every vertex of is at distance exactly two from another vertex in , is called an independent semitotal dominating set (ISTd-set) of . The independent semitotal domination number, denoted by , is the minimum cardinality of such a set. This paper investigates the Cartesian product , tensor product , and strong product of graphs, where is a connected noncomplete graph and is a nontrivial complete graph. Furthermore, the independent semitotal domination number for each of these graph products is determined.
Author: Bryan L. Susada
Institution: Davao Oriental State University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7140320147