In this paper, the concept of fuzzy graph is extended to a complex fuzzy graph. Complex fuzzy graphs are encountered in complex fuzzy set theory. The novelty of the complex fuzzy set lies in the range of values its membership function may attain. In contrast to a traditional fuzzy membership function, this range is not limited to [0, 1], but extended to the unit circle in the complex plane. Thu...

Let G be a fuzzy graph. A subset D of V is said to be Fuzzy dominating set if every vertex u ∈ V (G) there exists a vertex v ∈ V −D such that uv ∈ E(G) and μ(uv) 6 σ(u) ∧ σ(v). The minimum Cardinality of fuzzy dominating set is denoted by γf . A graph G is said to be fuzzy excellent if every vertex of G belongs to γf -sets of G. In this paper, we give a construction to imbedded non-excellent fu...

In this study we discuss about an application of fuzzy graph isomorphism. If we look two unequal fuzzy matrices on undirected fuzzy graphs, we cannot say either the fuzzy graphs of theses fuzzy matrices are isomorphic or not isomorphic. It is because two fuzzy matrices may look different even if the fuzzy graphs are isomorphic. In this study, by using the algorithm for fuzzy graph isomorphism i...

In this paper, we discuss balanced bipolar intuitionistic fuzzy graphs and study some of their properties 1.Introduction Graph theory is developed when Euler gave the solution to the famous Konigsberg bridge problem in 1736. Graph theory is very useful as a branch of combinatorics in the field of geometry, algebra, number theory, topology, operations research, optimization and computer science....

In this paper a vitality analysis of fuzzy system, represented by fuzzy graph is considered. A division of fuzzy graph into components by graph edge removing is used as destruction criterion of considered fuzzy system. A vitality of system estimates by definition of degree of vitality, which is suggested in this paper.

This paper studies a fuzzy graph rewriting with single pushout approach from a viewpoint of fuzzy relational calculus. Two possible kinds of matchings for fuzzy graph rewritings are given, namely, a rigorous matching which just generalizes matchings for crisp (or ordinary) graph rewritings, and an "-matching which represents rather ambiguous or fuzzy one. Finally the pullback structure of fuzzy...

Problem statement: In this study researchers propose a new fuzzy graph theoretic construct called fuzzy metagraph and a new method of clustering finding the similar fuzzy nodes in a fuzzy metagraph. Approach: We adopted T-norms (Triangular Norms) functions and join two or more Tnorms to cluster the fuzzy nodes. Fuzzy metagraph is the fuzzyfication of the crisp Metagraphs using fuzzy Generating ...