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 |
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
