Efficient Domination In Fuzzy Graphs and Intuitionistic Fuzzy Graphs in Strong and weak forms

Strong intuitionistic fuzzy graphs

We introduce the notion of strong intuitionistic fuzzy graphs and investigate some of their properties. We discuss some propositions of self complementary and self weak complementary strong intuitionistic fuzzy graphs. We introduce the concept of intuitionistic fuzzy line graphs.

Total Strong (Weak) Domination Intuitionistic Fuzzy Graph

Edge Domination in Intuitionistic Fuzzy Graphs

In this paper we introduce the concept of edge domination and total edge domination in intuitionistic fuzzy graphs. We determine the edge domination number and total edge domination number for several classes of intuitionistic fuzzy graphs and obtain bounds for them. We also obtain Nordhaus gaddum type results for the parameters.

Coverings, matchings and paired domination in fuzzy graphs using strong arcs

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

Edge Domination on Intuitionistic Fuzzy Graphs

Let D be the minimum dominating set of intuitionistic fuzzy graph G. The minimum intuitionistic fuzzy cardinality of all edge dominating set of intuitionistic fuzzy graph G is known as edge domination number and it is denoted by γe(G). In this Paper, we initiate some definitions onedge dominating set concerning intuitionistic fuzzy sets. Further, we investigate some results onedge domination nu...