in this paper, we introduce some properties of an intuitionistic normal fuzzy m-subgroup of m- group with m-homomorphism and isomorphism. we study he image, the pre-image and the inverse mapping of the intuitionistic normal fuzzy m-‎subgroups.‎

The notion of intuitionistic fuzzy graphs is introduced. We show how to associate an intuitionistic fuzzy sub(semi)group with an intuitionistic fuzzy graph in a natural way.

A flexible query model is presented for semi-structured information stored in well-formed XML documents, modeled as XML fuzzy graphs by computing estimates of the importance of the information associated to XML elements and attributes. The notion of fuzzy graph closure with threshold is then used to obtain a fuzzy extension of the XML fuzzy graphs' topological structure. Weights associated to c...

The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...

A resolving set for a graph Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension μ(Γ) is the smallest size of a resolving set for Γ. We consider the metric dimension of the dual polar graphs, and show that it is at most the rank over R of the incidence matrix of the corresponding polar spac...

In the present paper, we introduce an extension of the conceptual graph model suitable to the representation 7 of data which are modelized using fuzzy sets. We extend the specialization relation of the conceptual graph model to fuzzy conceptual graphs. Lastly we introduce a new way of comparing conceptual graphs, using the 9 idea that a graph may be compatible with another graph with a given de...

An essential feature of large scale free graphs, such as the Web, protein-to-protein interaction, brain connectivity, and social media graphs, is that they tend to form recursive communities. The latter are densely connected vertex clusters exhibiting quick local information dissemination and processing. Under the fuzzy graph model vertices are fixed while each edge exists with a given probabil...

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