This paper presents fuzzy graph rewriting systems with fuzzy relational calculus. In this paper fuzzy graph means crisp set of vetices and fuzzy set of edges. We provide $\mathrm{f}\mathrm{u}\mathrm{z},7,\mathrm{y}$ relational calculus witll Heyting algebra. Formalizing rewriting system of fuzzy graphs it is important to $\mathrm{c}\cdot 1_{1\mathrm{t})\mathrm{t}}.\mathrm{q}\mathrm{C}1$ how to ...

This paper investigates techniques to compare two fuzzy graphs. Fuzzy graphs have raised increasing attention, because they not only allow an easy interpretation but in addition finding regions of interest or tolerating missing attributes can be done computationally very efficiently. This is of great interest in numerous applications, for example Intelligent Data Analysis, Metamodeling and othe...

Methods to build function approximators from example data have gained considerable interest in the past. Especially methodologies that build models that allow an interpretation have attracted attention. Most existing algorithms, however, are either complicated to use or infeasible for high-dimensional problems. This article presents an ecient and easy to use algorithm to construct fuzzy graphs...

following the idea of $l$-fuzzy neighborhood system as introduced byfu-gui shi, and its generalization to $(l,m)$-fuzzy neighborhood system, the relationship between  $(l,m)$-fuzzy topology and $(l,m)$-fuzzy neighborhood system will be further studied. as an application of the obtained results, we will describe the initial structures of $(l,m)$-fuzzy neighborhood subspaces and $(l,m)$-fuzzy top...

In this paper we try to combine two approaches. One is the theory of knowledge graphs in which concepts are represented by graphs. The other is the axiomatic theory of fuzzy sets (AFS). The discussion will focus on the idea of fuzzy concept. It will be argued that the fuzziness of a concept in natural language is mainly due to the difference in interpretation that people give to a certain word....

Abstract A resolving set for a graph $$\Gamma $$ ? is collection of vertices S , chosen so that each vertex v the list distances from to members uniquely specifies . The metric dimension $$\mu (\Gamma )$$ ? ( ) smallest size We consider...