Results 31 to 40 of about 6,012,682 (310)
Geometry of good sets in n-fold Cartesian product [PDF]
, 2003 We propose here a multidimensional generalisation of the notion of link introduced in our previous papers and we discuss some consequences for simplicial measures and sums of function algebras.Comment: 17 pages, no figures, no ...
Klopotowski, A +2 more
core +4 more sources
Subtraction Menger algebras [PDF]
, 2010 characterizations of Menger algebras of partial $n$-place functions defined on a set $A$ and closed under the set-theoretic difference functions treatment as subsets of the Cartesian product $A^{n+1}$ are ...
B.M. Schein +12 more
core +2 more sources
Extensions of a result of Elekes and R\'onyai
, 2012 Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an $n\times n\times n$
de Zeeuw, Frank +2 more
core +1 more source
DP‐coloring Cartesian products of graphs
Journal of Graph Theory, 2022 AbstractDP‐coloring (also called correspondence coloring) is a generalization of list coloring introduced by Dvořák and Postle in 2015. Motivated by results related to list coloring Cartesian products of graphs, we initiate the study of the DP‐chromatic number, , of the same. We show that , where is the coloring number of the graph .
Hemanshu Kaul +3 more
openaire +3 more sources
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
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
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
On Cartesian product of Euclidean distance matrices
Linear Algebra and its Applications, 2019 If A ∈ R m × m and B ∈ R n × n , we define the product A ⊘ B as A ⊘ B = A ⊗ J n + J m ⊗ B , where ⊗ denotes the Kronecker product and J n is the n × n matrix of all ones.
R. Bapat, H. Kurata
semanticscholar +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
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