In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...

The concept of the strongest path plays a crucial role in fuzzy graph theory. In classical graph theory, all paths in a graph are strongest, with a strength value of one. In this article, we introduce Menger’s theorem for fuzzy graphs and discuss the concepts of strengthreducing sets and t-connected fuzzy graphs. We also characterize t-connected and t-arc connected fuzzy graphs. 2012 Elsevier I...

We define the Cartesian product, composition, union and join on interval-valued fuzzy graphs and investigate some of their properties. We also introduce the notion of interval-valued fuzzy complete graphs and present some properties of self complementary and self weak complementary interval-valued fuzzy complete graphs.

Abstract: The present paper is focusing on the order, size and degree of the nodes of the interval-valued fuzzy graphs, which are isomorphic. Isomorphism between Interval-valued fuzzy graphs is proved to be an equivalence relation, whereas the Weak isomorphism is proved to be a partial order. Few properties of interval valued fuzzy graphs, which are self complementary, are discussed.

In this paper we introduce the notion of intuitionistic fuzzy f morphism on intutionistic fuzzy graphs and regular intutionistic fuzzy graph. We study the action of intuitionistic fuzzy f morphism on intuitionistic fuzzy strong regular graphs. We derive some simple but elegent results on weak and coweak isomophisms. Mathematics Subject Classification: 03E72, 03F55

The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.

A problem of reducing intuitionistic fuzzy matrices is examined and some useful properties are obtained with respect to nilpotent intutionistic fuzzy matrices. First, reduction of irreflexive and transitive intuitionistic fuzzy matrices are considered, and then the properties are applied to nilpotent intutionistic fuzzy matrices. Nilpotent intuitionistic fuzzy matrices are intuitionistic fuzzy ...

uzzy graph theory is finding an increasing number of applications in modeling real time systems where the level of information inherent in the system varies with different levels of precision. In the applied field, the success of the use of fuzzy set theory depends on the choice of the membership function that we make. However, there are applications in which experts do not have precise knowled...

In this dissertation, we study the picture fuzzy graph (PFG) in decision-making problem based on relation and some types of graphs such as complete graphs, strong complement are described also Pythagorean decision making environment. Further, present an application Fuzzy Graphs Picture

Fuzzy Graphs are having numerous applications in problems like Network analysis, Clustering, Pattern Recognition and Neural Networks. The analysis of properties of fuzzy graphs has facilitated the study of many complicated networks like Internet. In this paper we study the structures of complement of many important fuzzy graphs such as Fuzzy cycles, Blocks etc. The complement of fuzzy graphs wi...