Results 31 to 40 of about 235,976 (317)
Neutrosophic Hyperideals of Semihyperrings [PDF]
In this paper, we have introduced neutrosophic hyperideals of a semihyperring and considered some operations on them to study its basic notions and properties.
Debabrata Mandal
doaj
Cartesian product of intuitionistic fuzzy subgroups [PDF]
Fuzzy sets have become fundamental tools for addressing uncertainty and ambiguity across a wide range of scientific disciplines. A significant development within fuzzy set theory is the emergence of fuzzy subgroups, which adapt fuzzy set principles to ...
Saman Abdurrahman
doaj +1 more source
On density of subgraphs of Cartesian products [PDF]
AbstractIn this paper, we extend two classical results about the density of subgraphs of hypercubes to subgraphs of Cartesian products of arbitrary connected graphs. Namely, we show that , where is the maximum ratio taken over all subgraphs of .
Chepoi, Victor +2 more
openaire +4 more sources
Subtraction Menger algebras [PDF]
characterizations of Menger algebras of partial $n$-place functions defined on a set $A$ and closed under the set-theoretic difference functions treatment as subsets of the Cartesian product $A^{n+1}$ are ...
B.M. Schein +12 more
core +2 more sources
Edge-Transitive Lexicographic and Cartesian Products
In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source
New Results on the Aggregation of Norms
It is a natural question if a Cartesian product of objects produces an object of the same type. For example, it is well known that a countable Cartesian product of metrizable topological spaces is metrizable.
Tatiana Pedraza +1 more
doaj +1 more source
The generalized 3-connectivity of Cartesian product graphs [PDF]
Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj +1 more source
Convex polygons in cartesian products
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of $n$ real numbers (for short, \emph{grid}). First, we prove that every such grid contains $\Omega(\log n)$ points in convex position and that this bound is tight up to a constant factor.
Claire Pennarun +7 more
openaire +8 more sources
On Cartesian Products of Signed Graphs [PDF]
In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main results is the unicity of the prime factor decomposition of signed graphs.
openaire +4 more sources
Motion planning in cartesian product graphs
Let G be an undirected graph with n vertices. Assume that a robot is placed on a vertex and n − 2 obstacles are placed on the other vertices. A vertex on which neither a robot nor an obstacle is placed is said to have a hole.
Deb Biswajit, Kapoor Kalpesh
doaj +1 more source

