INDEPENDENT SEMITOTAL DOMINATION IN THE CARTESIAN, TENSOR AND STRONG PRODUCTS OF GRAPHS
Far East Journal of Mathematical Sciences (FJMS) · 25.04.2026 · 143 (4) · 1073-1083
DOI: 10.17654/0972087126062 ↗Kurz gefasst
Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), online erschienen am 25.04.2026. Verfasst von Bryan L. Susada.
Abstract (Originalsprache)
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.
Zitieren
APA
Susada, B. L. (2026). INDEPENDENT SEMITOTAL DOMINATION IN THE CARTESIAN, TENSOR AND STRONG PRODUCTS OF GRAPHS. Far East Journal of Mathematical Sciences (FJMS), 143(4), 1073-1083. https://doi.org/10.17654/0972087126062
Vancouver
Susada BL. INDEPENDENT SEMITOTAL DOMINATION IN THE CARTESIAN, TENSOR AND STRONG PRODUCTS OF GRAPHS. Far East Journal of Mathematical Sciences (FJMS). 2026;143(4):1073-1083. doi:10.17654/0972087126062
BibTeX
@article{Susada2026,
author = {Susada, Bryan L.},
title = {INDEPENDENT SEMITOTAL DOMINATION IN THE CARTESIAN, TENSOR AND STRONG PRODUCTS OF GRAPHS},
journal = {Far East Journal of Mathematical Sciences (FJMS)},
year = {2026},
volume = {143},
number = {4},
pages = {1073--1083},
doi = {10.17654/0972087126062}
}
EUVIMED