Zero forcing and power domination for lexicographic product of two fuzzy soft graphs

Abstract

Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed, and additional vertices become observed based on some rules. In both cases, the goal is to eventually observe the entire graph using the fewest number of initial vertices. In this paper, we combine the study of zero forcing and power domination and compute upper bound for zero forcing for lexicographic product of two fuzzy soft graphs.