Additional Information
| Author(s) | Drazenska, Emilia, Klesc, Marian |
|---|
The crossing numbers of products of the graph K2,2,2 with stars
Emilia Drazenska ♦ Marian Klesc
Full PDF
carpathian_2008_24_3_327_331There are several known exact results on the crossing numbers of Cartesian products of stars and graphs of order four or five. In the paper, we extend these results and we prove that the crossing number of the Cartesian product of the complete tripartite graph K2,2,2 with the star Sn is 6b n 2 cb n−1 2 c + 6n.
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration