Results 1 to 10 of about 21,679 (290)
The Diagnosability of the Generalized Cartesian Product of Networks [PDF]
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 [PDF]
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\
Chao Yang, Jun-Ming Xu
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
The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices [PDF]
Huiqin Jiang +2 more
exaly +2 more sources
The localization game on Cartesian products [PDF]
The localization game is played by two players: a Cop with a team of $k$ cops, and a Robber. The game is initialised by the Robber choosing a vertex $r \in V$, unknown to the Cop. Thereafter, the game proceeds turn based. At the start of each turn, the Cop probes $k$ vertices and in return receives a distance vector.
Jeandré Boshoff, Adriana Roux
openaire +2 more sources
Product of Two Fuzzy Normed Spaces and its Completion [PDF]
The aim of this paper is to prove that the Cartesian product of two complete fuzzy normed space is again a complete fuzzy normed space. Also to prove that the Cartesian product of two complete fuzzy inner product spaces is a complete fuzzy inner product ...
Raghad Ibrahem.Sabre
doaj +1 more source
The majority coloring of the join and Cartesian product of some digraph [PDF]
A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vertices with the same color in the out-neighborhood does not exceed half of its out-degree.
Shi Mei +3 more
doaj +1 more source
The Cartesian product of hypergraphs [PDF]
AbstractWe show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a unique prime factor decomposition with respect to the (weak) Cartesian product, even if it has infinitely many factors. This generalizes previous results for graphs and undirected hypergraphs to directed and infinite hypergraphs. The proof adopts the
Lydia Ostermeier +2 more
openaire +3 more sources
Fuzzy Bigroup from another Viewpoint
In group theory, given two groups G and H, it is possible to construct a new group from the Cartesian product of G and H, G × H. With this as a motivation, we replicate this concept in fuzzy group algebra.
L. S. Akinola +4 more
doaj +3 more sources
On Well-Covered Cartesian Products [PDF]
12 pages, 2 ...
Bert L. Hartnell +2 more
openaire +3 more sources

