Results 11 to 20 of about 14,964 (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
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 +4 more sources
Distinguishing Cartesian Products of Countable Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +4 more sources
On density of subgraphs of Cartesian products [PDF]
Journal of Graph Theory, 2019 AbstractIn this paper, we extend two classical results about the density of subgraphs of hypercubes to subgraphs of Cartesian products of arbitrary connected graphs. Namely, we show that , where is the maximum ratio taken over all subgraphs of .
Chepoi, Victor +2 more
openaire +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
Linkedness of Cartesian products of complete graphs [PDF]
, 2022 This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least 2k vertices is k-linked if, for every set of 2k distinct vertices organised in arbitrary k pairs of vertices, there are k vertex-disjoint paths ...
L K Jørgensen (13347852) +6 more
core +2 more sources
On Well-Covered Cartesian Products [PDF]
Graphs and Combinatorics, 2018 12 pages, 2 ...
Bert L. Hartnell +2 more
openaire +3 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 +3 more sources
On the Gonality of Cartesian Products of Graphs [PDF]
The Electronic Journal of Combinatorics, 2020 In this paper we provide the first systematic treatment of Cartesian products of graphs and their divisorial gonality, which is a tropical version of the gonality of an algebraic curve defined in terms of chip-firing. We prove an upper bound on the gonality of the Cartesian product of any two graphs, and determine instances where this bound holds with
Ivan Aidun, Ralph Morrison
openaire +3 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