Conceptual graphs are very useful for representing structured knowledge. However, existing formulations of fuzzy conceptual graphs are not suitable for matching images of natural scenes. This paper presents a new variation of fuzzy conceptual graphs that is more suited to image matching. This variant differentiates between a model graph that describes a known scene and an image graph which desc...

in this paper, we introduce a new concept of fuzzy generalizedcontraction and give a fixed point result for such mappings in the setting of fuzzy m-complete metric spaces. we also give an affirmative partial answer to a question posed by wardowski [d. wardowski, fuzzy contractive mappings and fixed points in fuzzy metric spaces, fuzzy set syst., {bf 222}(2013), 108-114].some examples are also g...

In this paper, a novel moving object modeling suitable for multicamera correspondence is introduced. Taking into consideration the color and motion features of foreground objects in each independent video stream, our method segments the existing moving objects and constructs a graph-based structure to maintain the relational information of each segment. Using such graph structures reduces our c...

The competition graph of a doubly partial order is known to be an interval graph. The competition-common enemy graph of a doubly partial order is also known to be an interval graph unless it contains a cycle of length 4 as an induced subgraph. In this paper, we show that the niche graph of a doubly partial order is not necessarily an interval graph. In fact, we prove that, for each n ≥ 4, there...

the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...

In this paper, we propose a new method for solving fuzzy partial differential equation using fuzzy Sumudu transform. First, we provide fundamental results of fuzzy Sumudu transform for fuzzy partial derivatives and later use them to construct the solution of fuzzy partial differential equations. Finally, we demonstrate an example to show the capability of the proposed method and present the res...

The complexity of the maximum common connected subgraph problem in partial k-trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplanar graphs, a subclass of the partial 2-trees. On the contrary, the problem is known to be NP-hard in vertex-labeled partial 11-trees of bounded degree. We consider series-parallel graphs, i.e., partial 2-trees. We show ...