Dominating set of fuzzy and anti-fuzzy graphs using algorithms.

In this article, we discuss a dominating set D in a fuzzy graph F and anti fuzzy graph FA. The boundaries on the domination number of an anti-fuzzy graph are obtained. A fuzzy matrix is defined on an anti-fuzzy graph. Some properties of the adjacency fuzzy matrix are discussed. Using a strong adjacency matrix, an algorithm is formulated to find a minimal dominating set of an anti fuzzy graph FA and by using a strong neighborhood fuzzy matrix, an algorithm is defined to predict the total dominating set for FA. [ABSTRACT FROM AUTHOR]