Disjunctive total domination in some graphs derived from the subdivision graph

Abstract

For a set S ⊆ V (G), if every vertex has a neighbor in S or has at least two vertices in S at distance two from it, then the set S is a disjunctive total dominating set of G. The minimum cardinality of such a set is equal to the disjunctive total domination number. In this study, we discuss disjunctive total domination number of some graphs derived from the subdivision graphs such as middle and central graphs.