Domination number of complete restrained fuzzy graphs

Abstract

This work is concerned with the restrained complete domination number and triple connected domination number of fuzzy graphs. Some basic definitions and needful results are given with an example. The necessary and sufficient conditions for the fuzzy graph to be a complete restrained domination set is formulated and proved. Also the relation between complete restrained domination set and n-dominated set is illustrated. Finally, triple connected domination number of a restrained complete fuzzy graph is provided.