Results 1 to 10 of about 5,083 (246)
The Diagnosability of the Generalized Cartesian Product of Networks
Motivated by two typical ways to construct multiprocessor systems, matching composition networks and cycle composition networks, we generalize the definition of the Cartesian product of networks and consider the classical diagnosability of the ...
Meirun Chen, Cheng-Kuan Lin
doaj +4 more sources
Connectivity of Cartesian product graphs
Let \(n(G)\), \(\kappa(G)\), \(\lambda(G)\) and \(\delta(G)\) be the order, connectivity, edge-connectivity and minimum degree of a (di-)graph, respectively. In addition, let \(G_1\times G_2\) be the Cartesian product of two (di-)graphs \(G_1\) and \(G_2\). If \(G_1,G_2\) are two connected graphs, then the authors prove that \(\kappa(G_1\times G_2)\geq\
Jun-Ming Xu, Chao Yang
exaly +4 more sources
On the hamiltonicity of the cartesian product
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vassilios V Dimakopoulos +1 more
exaly +4 more sources
Cartesian product of synchronization transitions and hysteresis [PDF]
We present theoretical results when applying the Cartesian product of two Kuramoto models on different network topologies. By a detailed mathematical analysis, we prove that the dynamics on the Cartesian product graph can be described by the canonical ...
Changsu Wang +3 more
doaj +2 more sources
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 +2 more sources
On primality of Cartesian product of graphs [PDF]
PurposeThe present work focuses on the primality and the Cartesian product of graphs.Design/methodology/approachGiven a graph G, a subset M of V (G) is a module of G if, for a, b ∈ M and x ∈ V (G) \ M, xa ∈ E(G) if and only if xb ∈ E(G).
Nadia El Amri +2 more
doaj +2 more sources
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 +2 more sources
MDR codes and self-dual codes on Cartesian product codes
A Cartesian product code of the linear codes C1 , , C s in 1 , ,Z r Z rs was defined. According to the theorem of submodulo isomorphism, the relationship between the rank of the Cartesian product code C1 × C 2 × × Cs over Z r1 × Z r2 × × Zrsand C1 , C 2,
LIU Xiu-sheng
doaj +3 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 +2 more sources
On Path-Pairability in the Cartesian Product of Graphs
We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive and multiplicative inheritance patterns of path-pairability, depending on the number of vertices in the Cartesian product.
Mészáros Gábor
doaj +2 more sources

