In this paper, ‎The powers of fuzzy neutrosophic soft square matrices (FNSSMs) under the operations $oplus(=max)$ and $otimes(=min)$ are studied‎. ‎We show that the powers of a given FNSM stabilize if and only if its orbits stabilize for each starting fuzzy neutrosophic soft vector (FNSV) and prove a necessary and sufficient condition for this property using the associated graphs of the FNSM‎. ...

In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost edit path between graphs, we introduce the notion of fuzzy edit paths between graphs and provide a quadratic programming formulation for the minimization of fuzzy edit costs. Experiments on real-world graph data demonstr...

Cooccurrence graphs easily grow very dense when applied to represent binary association patterns of large amounts of data. Therefore, postprocessing is needed to extract valuable information from them. We propose an approach to identify subgraphs of cooccurrence graphs that show a certain temporal behavior. This behavior is described with linguistic variables and fuzzy connectives defined over ...

The concept of vague graph was introduced by Ramakrishna in [12]. A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility, and compatibility to a system when compared with systems that are designed using fuzzy graphs. The main purpose of this paper is to introduce the concept of dominating set, perfect dominating set, minimal perfect dominating set and i...

In this paper we present a method of image indexing and retrieval which takes into account the relative positions of the regions within the image. Indexing is based on a segmentation of the image into fuzzy regions ; we propose an algorithm which produces a fuzzy segmentation. The image retrieval is based on inexact graph matching, taking into account both the similarity between regions and the...

Fuzzy circular interval graphs are a generalization of proper circular arc graphs and have been recently introduced by Chudnovsky and Seymour as a fundamental subclass of claw-free graphs. In this paper, we provide a polynomial-time algorithm for recognizing such graphs, and more importantly for building a suitable representation.