Results 31 to 40 of about 5,146,733 (247)
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
Completeness and Cartesian Product in Neutrosophic Rectangular n-Normed Spaces
Dera Natung Government College Research JournalThis 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
Motion planning in cartesian product graphs
Discussiones Mathematicae Graph Theory, 2014 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 +1 more source
Convex polygons in cartesian products
Journal of Computational Geometry, 2018 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}). First, we prove that every such grid contains $\Omega(\log n)$ points in convex position and that this bound is tight up to a constant factor.
De Carufel, Jean-Lou +6 more
openaire +7 more sources
On Total Domination in the Cartesian Product of Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2016 Ho proved in [A note on the total domination number, Util. Math. 77 (2008) 97–100] that the total domination number of the Cartesian product of any two graphs without isolated vertices is at least one half of the product of their total domination numbers.
B. Brešar +3 more
semanticscholar +1 more source
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]
Transactions on Combinatorics, 2017 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
MDR codes and self-dual codes on Cartesian product codes
Tongxin xuebao, 2010 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 +2 more sources
On a product of universal hyperalgebras
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 We introduce and study a new operation of product of universal hyperalgebras which lies, with respect to set inclusion, between the cartesian product of the hyperalgebras and the cartesian product of their idempotent hulls.
Chaisansuk Nitima, Šlapal Josef
doaj +1 more source
On the Crossing Numbers of Cartesian Products of Wheels and Trees
Discussiones Mathematicae Graph Theory, 2017 Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián +2 more
doaj +1 more source
Cartesian product of synchronization transitions and hysteresis
New Journal of Physics, 2017 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 +1 more source