carpathian_2023_39_2_371_382The crossing number 
of a graph 
is the minimum number of edge crossings over all drawings of in the plane. In the paper, the crossing number of the join product 
for the connected graph 
on six vertices consisting of one path on four vertices 
and two leaves adjacent with the same outer vertex of the path is given, where 
consists of 
isolated vertices. Finally, by adding some edges to the graph , we obtain the crossing numbers of the join products of other four graphs with .
| Author(s) | Berežný, Štefan, Staš, Michal |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2023.02.03 |
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
