INDEPENDENT SEMITOTAL DOMINATION IN THE CARTESIAN, TENSOR AND STRONG PRODUCTS OF GRAPHS

Read full text Summarise with VIRAT
Authors: Bryan L. Susada
Cited by: 0
References: 10

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

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.

Fields of Study & Subjects

Advanced Graph Theory Research Graph Labeling and Dimension Problems Graph theory and applications

Publication details

Journal / source
Far East Journal of Mathematical Sciences (FJMS)
Volume
143
Issue
4
Pages
1073–1083
Publication date
25 March 2026
Language
EN