Results 1 to 10 of about 14,964 (295)
Connected domination game played on Cartesian products [PDF]
Open Mathematics, 2019 The connected domination game on a graph G is played by Dominator and Staller according to the rules of the standard domination game with the additional requirement that at each stage of the game the selected vertices induce a connected subgraph of G. If
Bujtás Csilla +3 more
doaj +3 more sources
Convex polygons in cartesian products
Journal of Computational Geometry, 2021 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}).
Jean-Lou De Carufel +6 more
doaj +8 more sources
Quality-based generation of weather radar Cartesian products [PDF]
Atmospheric Measurement Techniques, 2015 Weather radar data volumes are commonly processed to obtain various 2-D Cartesian products based on the transfer from polar to Cartesian representations through a certain interpolation method. In this research an algorithm of the spatial interpolation of
K. Ośródka, J. Szturc
doaj +3 more sources
T-Fuzzy Structure on JU-Algebra [version 1; peer review: 3 approved] [PDF]
F1000ResearchIntroduction This study explored the application of T-norms in fuzzy algebra, specifically by examining JU-subalgebras and JU-ideals derived from crisp JU-algebras. We investigated the properties of the T-fuzzy structures within this algebraic framework.
Selamawit Hunie Gelaw +2 more
doaj +2 more sources
Topological conjugacy of n-multiple Cartesian products of circle rough transformations [PDF]
Известия высших учебных заведений: Прикладная нелинейная динамика, 2021 It is known from the 1939 work of A. G. Mayer that rough transformations of the circle are limited to the diffeomorphisms of Morse – Smale. A topological conjugacy class of orientation-preserving diffeomorphism is entirely determined by its ...
Golikova, Iuliana Viktorovna +1 more
doaj +1 more source
The localization game on Cartesian products [PDF]
Discrete Applied Mathematics, 2021 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
Cartesian product of hypergraphs: properties and algorithms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 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
Graph Sampling Through Graph Decomposition and Reconstruction Based on Kronecker Graphs [PDF]
Journal of Systemics, Cybernetics and Informatics, 2022 The connectedness of the social network gives rise to a new challenge of how to efficiently sample the network and keep the graph properties and topology properties as well.
Shen Lu, Les Piegl, Richard S. Segall
doaj
The Cartesian product of hypergraphs [PDF]
Journal of Graph Theory, 2011 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
Sum Connectivity Index Under the Cartesian and Strong Products Graph of Monogenic Semigroup
International Journal of Analysis and Applications, 2023 This field’s main feature is to implement the sum connectivity index method. This sum connectivity index method can solve the monogenic semigroups under the cartesian and strong products.
R. Rajadurai, G. Sheeja
doaj +1 more source