The crossing numbers of join products of eight graphs of order six with paths and cycles
The crossing number $\mathrm{cr}(G)$ of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. The main aim of this paper is to give the crossing numbers of the join products of eight graphs on six vertices with paths and cycles on $n$ vertices. The proofs are don...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vasyl Stefanyk Precarpathian National University
2023-06-01
|
| Series: | Karpatsʹkì Matematičnì Publìkacìï |
| Subjects: | |
| Online Access: | https://journals.pnu.edu.ua/index.php/cmp/article/view/5173 |