Results 21 to 30 of about 241,056 (327)
Cartesian product of intuitionistic fuzzy subgroups [PDF]
Notes on IFSFuzzy 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
Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms [PDF]
, 2013 It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time.
Hellmuth, Marc +2 more
core +1 more source
New Results on the Aggregation of Norms
Mathematics, 2021 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
DP‐coloring Cartesian products of graphs
Journal of Graph Theory, 2022 AbstractDP‐coloring (also called correspondence coloring) is a generalization of list coloring introduced by Dvořák and Postle in 2015. Motivated by results related to list coloring Cartesian products of graphs, we initiate the study of the DP‐chromatic number, , of the same. We show that , where is the coloring number of the graph .
Hemanshu Kaul +3 more
openaire +3 more sources
Motion planning in cartesian product graphs
Discussiones Mathematicae Graph Theory, 2014 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
The generalized 3-connectivity of Cartesian product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj +1 more source
Completeness and Cartesian Product in Neutrosophic Rectangular n-Normed Spaces
Dera Natung Government College Research JournalThis study introduces the new concept of neutrosophic rectangular $n$-normed spaces, along with essential foundational definitions. It then explores the Cartesian product of such spaces and examines how this operation influences their structural ...
Mukhtar Ahmad, Mohammad Mursaleen
doaj +1 more source
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]
Transactions on Combinatorics, 2017 Let $G$ be a graph and $chi^{prime}_{aa}(G)$ denotes the minimum number of colors required for an acyclic edge coloring of $G$ in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for $
Fatemeh Sadat Mousavi, Massomeh Noori
doaj +1 more source
Convex polygons in cartesian products
Journal of Computational Geometry, 2018 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.
De Carufel, Jean-Lou +6 more
openaire +7 more sources
The Cartesian product of graphs with loops [PDF]
, 2014 We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one ...
Christiaan E. Van De Woestijne +7 more
core