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 |
The approximate solution of the general split variational inequality problem by intermixed iteration
Collectively coincidence results for lower semicontinuous multifunctions in locally convex spaces
Second-order necessary conditions for bilevel programs via KKT reformulation
An inertial method for solving the split equality fixed point problem with multiple output sets
Asymptotic modeling of non-linear viscopiezoelectric Kelvin-Voigt type plates via Trotter theory
Properties of isocompact spaces in topological groups
Two generalized cyclic projection algorithms for solving a class of the split feasibility problem in real Hilbert spaces
Global-fixed-point property of gyrogroup actions
On simple normal structure and best proximity points in reflexive Banach space
Unified Convergence Analysis of Certain At Least Fifth Order Methods
