ZERO FORCING AND POWER DOMINATION FOR LEXICOGRAPHIC PRODUCT OF TWO FUZZY SOFT GRAPHS

Özet

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