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...

Graph theory has numerous application to problems in systems analysis, operations research, economics, and transportation. However, in many cases, some aspects of a graph-theoretic problem may be uncertain. For example, the vehicle travel time or vehicle capacity on a road network may not be known exactly. In such cases, it is natural to deal with the uncertainty using the methods of fuzzy sets...

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 ...

In a large fuzzy rule-based system, a great dealof computation time is required for a fuzzy inference engine. A given fuzzy rule-based system is modeled as a fuzzy inference graph where each node in the graph corresponds to a relation representing a rule in the rule-based system. This paper presents algorithms to minimize the number of nodes in the graph using fuzzy operations as well as their ...

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...