Let be a simple undirected fuzzy graph. A subset S of V is called a dominating set in G if every vertex in V-S is effectively adjacent to at least one vertex in S. A dominating set S of V is said to be a Independent dominating set if no two vertex in S is adjacent. The independent domination number of a fuzzy graph is denoted by (G) which is the smallest cardinality of a independent dominating ...

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

A subset S of V is called a dominating set in G if every vertex in V-S is adjacent to at least one vertex in S. A Dominating set is said to be Fuzzy Double Dominating set if every vertex in V-S is adjacent to at least two vertices in S. The minimum cardinality taken over all, the minimal double dominating set is called Fuzzy Double Domination Number and is denoted by γ fdd (G). The minimum numb...

Double crises of chaotic oscillators in the presence of fuzzy uncertainty are studied by means of the fuzzy generalized cellmappingmethod.A fuzzy chaotic attractor is characterized by its global topology and membership distribution. A fuzzy crisis implies a simultaneous sudden change both in the topology of the chaotic attractor and in its membership distribution. It happenswhen a fuzzy chaotic...

In a graph G, a vertex dominates itself and its neighbors. A subset S of V is called a dominating set in G if every vertex in V-S is adjacent to at least one vertex in S. The minimum cardinality taken over all, the minimal double dominating set which is called Fuzzy Double Domination Number and which is denoted as ) (G fdd  . A set V S  is called a Triple dominating set of a graph G if every ...

The classic K-Cycle problem asks if a graph G, with vertex set V (G), has a simple cycle containing all vertices of a given set K TM V (G). In terms of colored graphs, it can be rephrased as follows: Given a graph G, a set K TM V (G) and an injective coloring c : K æ {1, 2, . . . , |K|}, decide if G has a simple cycle containing each color in {1, 2, . . . , |K|} (once). Another problem widely k...

Here we consider the p-center problem on different types of fuzzy networks. In particular, we are interested in the networks with interval and triangular fuzzy arc lengths and vertex-weights. A methodology to obtain the best satisfaction level of the decision maker who wishes to reduce the cost within the tolerance limits is proposed. Illustrative examples are provided.

Networks commonly exhibit a community structure, whereby groups of vertices are more densely connected to each other than to other vertices. Often these communities overlap, such that each vertex may occur in more than one community. However, two distinct types of overlapping are possible: crisp (where each vertex belongs fully to each community of which it is a member) and fuzzy (where each ve...

P-normGeneralizedTrapezoidalIntuitionisticFuzzyNumberisthemostgeneralizedformofFuzzy aswellasIntuitionisticFuzzyNumber.Ithasahugeapplicationwhilesolvingvariousproblemsin impreciseenvironment.Inthispapertheauthorshavediscussedsomebasicarithmeticoperationsof p-normGeneralizedTrapezoidalIntuitionisticFuzzyNumbersusingtwodifferentmethods(extensio...