Additional Information
| Author(s) | KleÅ¡Ä, Marián, Petrillová, Jana, Valo, Matúš |
|---|
Minimal number of crossings in strong product of paths
Marián KleÅ¡Ä ♦ Jana Petrillová ♦ Matúš Valo
Abstract
carpathian_2013_29_1_027_032_abstractThe crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of GG in the plane. The exact crossing number is known only for few specific families of graphs. Cartesian products of two graphs belong to the first families of graphs for which the crossing number has been studied. Some results concerning crossing numbers are also known for join products of two graphs. In the paper, we start to collect the crossing numbers for the strong product of graphs, namely for the strong product of two paths.
Related Products
Recently posted
-
Stability of new functional equations and partial multipliers in Banach *-algebras
-
Characterizations of amenable gyrogroups related to Tarski's Theorem
-
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
-
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
-
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
-
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
-
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
-
Consequences of the product rule in Stieltjes differentiability
-
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
-
A quaternionic product of simple ratios