Results 11 to 20 of about 16,768 (145)
On Power Graph of Some Finite Rings [PDF]
Consider a ring $R$ with order $p$ or $p^2$, and let $\mathcal{P}(R)$ represent its multiplicative power graph. For two distinct rings $R_1$ and $R_2$ that possess identity element 1, we define a new structure called the unit semi-cartesian ...
Masoumeh Soleimani, Mohamad Hasan Naderi
doaj +1 more source
On Well-Covered Cartesian Products [PDF]
12 pages, 2 ...
Bert L. Hartnell +2 more
openaire +3 more sources
Hamilton-connected properties in cartesian product [PDF]
In this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. We present some sufficient and necessary conditions for $GBox H$ being hamilton-connected when $G$ is a hamilton-connected ...
Rushengul Hoshur, Elkin Vumar
doaj
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
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
Cartesian product of hypergraphs: properties and algorithms [PDF]
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto +2 more
doaj +1 more source
DP‐coloring Cartesian products of graphs
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
The generalized 3-connectivity of Cartesian product graphs [PDF]
Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj +1 more source
Completeness and Cartesian Product in Neutrosophic Rectangular n-Normed Spaces
This 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

