نتایج جستجو برای: valued homomorphism

تعداد نتایج: 43319  

2009
Enric Trillas Claudio Moraga Eloy Renedo

By interpreting ‘p is impossible’ by ‘p is selfcontradictory’, and ‘p is always’ by ‘not p is self-contradictory’, this paper studies which of the three-valued systems of Łucasiewicz, Gödel, Kleene, Bochvar, and Post, do verify the Aristotle’s principles of Non-Contradiction (NC), and Excluded-Middle (EM). Keywords— Systems of three-valued logic, Non-Contradiction, Excluded-Middle.

Journal: :Electronic Journal of Combinatorics 2023

We show that for every binary matroid $N$ there is a graph $H_*$ such the graphic $M_G$ of $G$, matroid-homomorphism from to if and only graph-homomorphism $G$ $H_*$. With this we prove complexity dichotomy problem $\rm{Hom}_\mathbb{M}(N)$ deciding $M$ admits homomorphism $N$. The polynomial time solvable has loop or no circuits odd length, otherwise $\rm{NP}$-complete. also get dichotomies lis...

Journal: :iranian journal of fuzzy systems 2011
abdelaziz amroune bijan davvaz

the starting point of this paper is given by priestley’s papers, where a theory of representation of distributive lattices is presented. the purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. in this way, some results of priestley’s papers are extended. in the main theorem, we show that the category of finite fuzzy priestley space...

Journal: :Transactions of the American Mathematical Society 1975

Journal: :European Journal for Philosophy of Science 2015

Journal: :Mathematische Zeitschrift 1997

1999
Paul A. Dreyer Christopher D. Malon

For every pair of nite connected graphs F and H, and every integer k, we construct a universal graph U with the following properties: 1. There is a homomorphism : U ! H, but no homomorphism from F to U . 2. For every graph G with maximal degree no more than k having a homomorphism h : G! H, but no homomorphism from F to G, there is a homomorphism : G! U , such that h = . Particularly, this solv...

Journal: :Ars Comb. 2014
Meysam Alishahi Ali Taherkhani

The chromatic sum Σ(G) of a graph G is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the existence of graph homomorphisms. Also, we present Σ(G) < χf (G)|G| for every graph G.

Journal: :Theor. Comput. Sci. 2015
Guillaume Guégan Pascal Ochem

We consider the complexity of oriented homomorphism and two of its variants, namely strong oriented homomorphism and pushable homomorphism, for planar graphs with large girth. In each case, we consider the smallest target graph such that the corresponding homomorphism is NP-complete. These target graphs T4, T5, and T6 have 4, 5, and 6 vertices, respectively. For i ∈ {4, 5, 6} and for every g, w...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید