Results 11 to 20 of about 2,865,652 (295)
Stability of cartesian products [PDF]
Journal of Combinatorial Theory, Series B, 1978 AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivial connected cartesian products and show that all such products are semi-stable. Further we show that except for certain (listed) restricted graphs, connected cartesian products are semi-stable at every vertex.
Julie Sims, Derek A. Holton
openaire +4 more sources
Connected domination game played on Cartesian products
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 +2 more sources
Edge-Transitive Lexicographic and Cartesian Products [PDF]
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 +3 more sources
Hermite-Hadamard's Inequality and the p-HH-Norm on the Cartesian Product of Two Copies of a Normed Space [PDF]
, 2008 The Cartesian product of two copies of a normed space is naturally equipped with the well-known p-norm. In this paper, another notion of norm is introduced, and will be called the p-HH-norm. This norm is an extension of the generalised logarithmic mean
Dragomir, Sever S, Kikianty, Eder
core +6 more sources
On New Notions of Orthogonality in Normed Spaces via the 2-HH-Norms [PDF]
, 2009 Kikianty and Dragomir in 2008 introduced the p-HH-norms on the Cartesian product of two copies of a normed space, which are equivalent to the well-known p-norms. In this paper, notions of orthogonality in terms of 2-HH-norms are introduced.
Dragomir, Sever S, Kikianty, Eder
core +6 more sources
Peg Solitaire on Cartesian Products of Graphs [PDF]
, 2021 In 2011, Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. In the same article, the authors proved some results on the solvability of Cartesian products, given solvable or distance 2-solvable graphs.
Wiljes, Jan-Hendrik de, Kreh, Martin
core +1 more source
On Well-Covered Cartesian Products [PDF]
Graphs and Combinatorics, 2018 12 pages, 2 ...
Bert L. Hartnell +2 more
openaire +4 more sources
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
On the hamiltonicity of the cartesian product
Information Processing Letters, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dimakopoulos, V. V. +2 more
openaire +4 more sources
On Cartesian Products of Signed Graphs [PDF]
Discrete Applied Mathematics, 2020 In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main results is the unicity of the prime factor decomposition of signed graphs.
openaire +2 more sources