Results 31 to 40 of about 5,083 (246)
Hamilton-connected properties in cartesian product [PDF]
Transactions on Combinatorics, 2012 In this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. We present some sufficient and necessary conditions for $GBox H$ being hamilton-connected when $G$ is a hamilton-connected ...
Rushengul Hoshur, Elkin Vumar
doaj
Convex polygons in cartesian products
J. Comput. Geom., 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
Neutrosophic Hyperideals of Semihyperrings [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we have introduced neutrosophic hyperideals of a semihyperring and considered some operations on them to study its basic notions and properties.
Debabrata Mandal
doaj
New Results on the Aggregation of Norms
Mathematics, 2021 It is a natural question if a Cartesian product of objects produces an object of the same type. For example, it is well known that a countable Cartesian product of metrizable topological spaces is metrizable.
Tatiana Pedraza +1 more
doaj +1 more source
The Cartesian product of graphs with loops
Ars Mathematica Contemporanea, 2015 We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one unlooped vertex. We also prove that this factorization can be computed in O(m) time, where m is the number
Tetiana Boiko +4 more
openaire +4 more sources
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source
The generalized 3-connectivity of Cartesian product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj +1 more source
Turing instabilities on Cartesian product networks [PDF]
, 2014 The problem of Turing instabilities for a reaction-diffusion system defined on a complex Cartesian product network is considered. To this end we operate in the linear regime and expand the time dependent perturbation on a basis formed by the tensor ...
Carletti, Timoteo; id_orcid +5 more
core +1 more source
On the Width of the Cartesian Product of Ordinals
Order, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
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