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 conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation of relational structures defined by monadic second-order formulas, or equivalently, has bounded clique-width. We prove that this conjecture is true if and only if it is true for the particular cases of bipartite undirected graphs, of ...

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

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

A graph is h-perfect if its stable set polytope can be completely described by nonnegativity, clique and odd-hole constraints. It is t-perfect if it furthermore has no clique of size 4. For every graph G and every c ∈ Z (G) + , the weighted chromatic number of (G, c) is the minimum cardinality of a multi-set F of stable sets of G such that every v ∈ V (G) belongs to at least cv members of F . W...

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

This work defines the concepts of strong efficient dominating set and intuitionistic fuzzy graph. We also introduce an graph a number graphs. The dominant in graphs has some limitations that are studied, derived..