DOWNHILL DOMINATION IN GRAPHS UNDER BINARY OPERATIONS
A path in a graph G is a downhill path if for all A subset is a downhill dominating set if every vertex lies on a downhill path originating from some vertex in S. This paper investigates the downhill dominating sets in the join, corona, complementary prism, lexicographic product, and strong product of graphs.
downhill path, downhill dominating set, downhill domination number.
