On (r,s)-Fuzzy Domination in Fuzzy Graphs
Let [Formula: see text] be a fuzzy graph on a finite set [Formula: see text] Let [Formula: see text] and [Formula: see text] A fuzzy subset [Formula: see text] of [Formula: see text] is called an [Formula: see text]-fuzzy dominating set ([Formula: see text]-FD set) of G if [Formula: see text] Then [Formula: see text] is called the [Formula: see text]-fuzzy domination number of [Formula: see text] where the minimum is taken over all [Formula: see text]-FD sets [Formula: see text] of [Formula: see text] In this paper we initiate a study of this parameter and other related concepts such as [Formula: see text]-fuzzy irredundance and [Formula: see text]-fuzzy independence. We obtain the [Formula: see text]-fuzzy domination chain which is analogous to the domination chain in crisp graphs.