In this paper, the concept of incidence domination number of graphs  is introduced and the incidence dominating set and  the incidence domination number  of some particular graphs such as  paths, cycles, wheels, complete graphs and stars are studied.

A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. Such a formula is always satisfiable. Matched formulas are used, for example, in the area of parameterized complexity. We prove that the problem of counting the number of the models (satisfying assignments) of a matched formula is #P-complete. On the other hand, we defin...

Complete pre-orders can be characterized in terms of the transitivity of the corresponding strict preference and indifference relations. In this paper, we investigate this characterization in a fuzzy setting. We consider two types of completeness (weak completeness and strong completeness) and decompose a fuzzy pre-order by means of an indifference generator, in particular a Frank t-norm. In th...

In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...

The paper presents a mathematical framework for approximate geometric reasoning with extended objects in the context of Geography, in which all entities and their relationships are described by human language. These entities could be labelled by commonly used names of landmarks, water areas, and so forth. Unlike single points that are given in Cartesian coordinates, these geographic entities ar...

First, we introduce the concept of intuitionistic fuzzy group congruenceand we obtain the characterizations of intuitionistic fuzzy group congruenceson an inverse semigroup and a T^{*}-pure semigroup, respectively. Also,we study some properties of intuitionistic fuzzy group congruence. Next, weintroduce the notion of intuitionistic fuzzy semilattice congruence and we givethe characterization of...

In this work we introduce the notion of fuzzy congruence relation on an ndgroupoid and study conditions on the nd-groupoid which guarantee a complete lattice structure on the set of fuzzy congruence relations. The study of these conditions allowed to construct a counterexample to the statement that the set of fuzzy congruences on a hypergroupoid is a complete lattice.

We define the Cartesian product, composition, union and join on interval-valued fuzzy graphs and investigate some of their properties. We also introduce the notion of interval-valued fuzzy complete graphs and present some properties of self complementary and self weak complementary interval-valued fuzzy complete graphs.

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

For sequences of fuzzy numbers, Nanda 1 studied the sequences of fuzzy numbers and showed that the set of all convergent sequences of fuzzy numbers forms a complete metric space. Kwon 2 introduced the definition of strongly p-Cesàro summability of sequences of fuzzy numbers. Savaş 3 introduced and discussed double convergent sequences of fuzzy numbers and showed that the set of all double conve...