Results 41 to 50 of about 21,679 (290)
The Cartesian product of graphs with loops
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 unlooped vertex. We also prove that this factorization can be computed in O(m) time, where m is the number
Tetiana Boiko +4 more
openaire +4 more sources
Metrics in Cartesian Product 1 [PDF]
Summary. A continuation of paper [6]. It deals with the method of creation of the distance in the Cartesian product of metric spaces. The distance of two points belonging to Cartesian product of metric spaces has been defined as sum of distances of ...
Stanisława Kanas
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
On the Width of the Cartesian Product of Ordinals
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
The generalized 3-connectivity of Cartesian product graphs [PDF]
Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj +1 more source
Strong perfectness of the generalized Cartesian product of graphs [PDF]
In this paper we give a necessary and sufficient condition for the generalized Cartesian product to be strongly perfect.
Szelecka, Alina +3 more
core +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
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]
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
Loosely Bernoulli Cartesian products [PDF]
For any totally ergodic loosely Bernoulli automorphism T , a class S (
openaire +1 more source

