Results 21 to 30 of about 14,964 (295)
The Crossing Number of Two Cartesian Products [PDF]
, 2007 There are several known exact results on the crossing number of Cartesian products of paths, cycles, and complete graphs.
Lin Zhao +3 more
core +1 more source
Weak k-reconstruction of Cartesian products [PDF]
, 2003 By Ulam's conjecture every finite graph G can be reconstructed from its deck of vertex deleted subgraphs. The conjecture is still open, but many special cases have been settled. In particular, one can reconstruct Cartesian products.
Imrich, Wilfried +2 more
core +1 more source
Recognizing triangulated Cartesian graph products [PDF]
, 2012 Computational meshes for numerical simulation frequently show—at least locally—a structure resembling a triangulated grid. Our goal is to recognize product-like structures in triangular meshes.
Shehzad Afzal +3 more
core +1 more source
Products of Geodesic Graphs and the Geodetic Number of Products
Discussiones Mathematicae Graph Theory, 2015 Given a connected graph and a vertex x ∈ V (G), the geodesic graph Px(G) has the same vertex set as G with edges uv iff either v is on an x − u geodesic path or u is on an x − v geodesic path.
Soloff Jake A. +2 more
doaj +1 more source
Different-distance sets in a graph [PDF]
Communications in Combinatorics and Optimization, 2019 A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.
Jason T. Hedetniemi +3 more
doaj +1 more source
Manifolds of mappings on Cartesian products [PDF]
Annals of Global Analysis and Geometry, 2022 AbstractGiven smooth manifolds $$M_1,\ldots , M_n$$ M 1 , … , M n ...
Helge Glöckner, Alexander Schmeding
openaire +4 more sources
The Crossing Numbers of Products of Path with Graphs of Order Six
Discussiones Mathematicae Graph Theory, 2013 The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known.
Klešč Marián, Petrillová Jana
doaj +1 more source
On Cartesian products of good lattices [PDF]
, 1976 Good lattices yield a powerful method of computing multiple integrals. Asymptotically, a lattice generated by one good lattice point is much more efficient than a Cartesian product of such lattices.
S. K. Zaremba
core +1 more source
Fractional Helly Theorem for Cartesian Products of Convex Sets [PDF]
, 2021 © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.Helly’s theorem and its variants show that for a family of convex sets in Euclidean space, local intersection patterns influence global ...
Hong Liu +7 more
core +2 more sources
Hypo-q-Norms on a Cartesian Product of Algebras of Operators on Banach Spaces
Annales Mathematicae Silesianae, 2020 In this paper we consider the hypo-q-operator norm and hypo-q-numerical radius on a Cartesian product of algebras of bounded linear operators on Banach spaces.
Dragomir Silvestru Sever
doaj +1 more source