Some Results of Total Domatic Number on Anti Fuzzy Graph

Let AG = (N, A, σ, μ) be an anti fuzzy graph. A partition DP = {D1, D2, ….., DK} of N(AG) is referred to as total domatic partition of AG if for each Di is a total dominating set of anti fuzzy graph AG and N(AG)= ⋃Di. The maximum cardinality taken over all maximum number of classes with a minimal total domatic partition of AG is called the total domatic number of AG and it is denoted by . The maximum number of classes with maximum fuzzy cardinality of a partition Di (AG) is called anti fuzzy total domatic number of anti fuzzy graph AG and it is denoted by . In this paper, we gain some preferred results and limits that referring to the full domatic number on anti fuzzy graph.