Results 21 to 30 of about 152,483 (296)
Properties of neutrosophic κ-ideals in subtraction semigroups G [PDF]
Our aim is to explore the idea of neutrosophic N-ideals in near-subtraction semigroups in this article and obtain some outcomes that are equivalent to them. We also illustrate the notion of a neutrosophic κ-intersection.
G. Muhiuddin +3 more
doaj +1 more source
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs [PDF]
Over 50 years ago, Lovász proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph. Other equivalence relations on graphs, such as cospectrality or fractional isomorphism, can be characterized by ...
L. Mančinska, David E. Roberson
semanticscholar +1 more source
In this paper, we presented a new properties of a weakly completely prime graph, where we added the algebraic properties in this graph and extracted from them some important theories and results, with the study of homomorphism in this graph when ...
ameer al-swidi, Ahmed A.Omran
doaj +1 more source
A Study on Interval-Valued Fuzzy Graph with Application in Energy Industry Management
In this paper, we define the concept of level graphs on interval-valued fuzzy graphs (IVFGs) and introduce the notions of α,β−α,β− homomorphism, isomorphism, weak isomorphism, and co-weak isomorphism of IVFGs by α,β− homomorphism. Also, an application of
Xiaoli Qiang +5 more
doaj +1 more source
On Homomorphism and Cartesian Products of Intuitionistic Fuzzy PMS-subalgebra of a PMS-algebra
In this paper, we introduce the notion of intuitionistic fuzzy PMS-subalgebras under homomorphism and Cartesian product and investigate several properties.
Beza Lamesgin Derseh +2 more
doaj +1 more source
K-algebras on quadripartitioned single valued neutrosophic sets [PDF]
Quadripartitioned single valued neutrosophic (QSVN) set is a powerful structure where we have four components Truth-T, Falsity-F, Unknown-U and Contradiction-C.
Mohanasundari Mohan, Mohana Krishnaswamy
doaj +1 more source
Soft set theory was introduced by Molodtsov to deal with uncertainty. In this manuscript, we commence with the notion of soft near-semirings based on soft set theory.
Waheed Ahmad Khan +2 more
doaj +1 more source
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of attention in literature; in particular, the way the graph-theoretical structure of the variables and constraints ...
Bulatov, Andrei A. +3 more
openaire +6 more sources
Towards a directed homotopy type theory [PDF]
In this paper, we present a directed homotopy type theory for reasoning synthetically about (higher) categories, directed homotopy theory, and its applications to concurrency. We specify a new `homomorphism' type former for Martin-L\"of type theory which
Brown +13 more
core +2 more sources
The undecidability of joint embedding and joint homomorphism for hereditary graph classes [PDF]
We prove that the joint embedding property is undecidable for hereditary graph classes, via a reduction from the tiling problem. The proof is then adapted to show the undecidability of the joint homomorphism property as well.Comment: 17 pages; DMTCS ...
Samuel Braunfeld
semanticscholar +1 more source

