Results 41 to 50 of about 232,590 (215)
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
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
k-tuple colorings of the Cartesian product of graphs [PDF]
, 2017 A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two vertices are adjacent, the corresponding sets of colors are disjoint.
Bonomo, Flavia +3 more
core +1 more source
The antimagicness of the Cartesian product of graphs [PDF]
Theoretical Computer Science, 2009 AbstractAn antimagic labeling of a graph with M edges and N vertices is a bijection from the set of edges to the set {1,2,3,…,M} such that all the N vertex-sums are pairwise distinct, where the vertex-sum of a vertex v is the sum of labels of all edges incident with v. A graph is called antimagic if it has an antimagic labeling.
Xiaoming Sun, Yuchen Zhang
openaire +1 more source
The fault-diameter of Cartesian products
Advances in Applied Mathematics, 2008 AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any of its ...
Banič, Iztok, Žerovnik, Janez
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
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
Total irregularity strength for product of two paths
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper we define a totally irregular total labeling for Cartesian and strong product of two paths, which is at the same time vertex irregular total labeling and also edge irregular total labeling.
Muhammad Kamran Siddiqui +2 more
doaj +1 more source
The Seidel morphism of Cartesian products [PDF]
Algebraic & Geometric Topology, 2009 We prove that the Seidel morphism of $(M \times M', \omega \oplus \omega')$ is naturally related to the Seidel morphisms of $(M,\omega)$ and $(M',\omega')$, when these manifolds are monotone. We deduce that any homotopy class of loops of Hamiltonian diffeomorphisms of one component, with non-trivial image via Seidel's morphism, leads to an injection of
openaire +4 more sources
On the Crossing Numbers of Cartesian Products of Wheels and Trees
Discussiones Mathematicae Graph Theory, 2017 Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián +2 more
doaj +1 more source