Crossing Numbers of Graphs is the first book devoted to the crossing number, an
increasingly popular object of study with surprising connections. The field has matured into a …

The crossing number of a graph G is the minimum number of edge crossings over all
drawings of G in the plane. Recently, the crossing numbers of join products of two graphs …

The crossing number of a graph G is the minimum number of edge crossings over all
drawings of G in the plane. The main purpose of this paper is to determine the crossing …

In the paper, the crossing number of the join product G∗+ D n for the disconnected graph
G∗ consisting of one isolated vertex and of one component isomorphic to K 1, 1, 2 is given …

The main purpose of this article is broaden known results concerning crossing numbers for
join of graphs of order six. We give the crossing number of the join product G+ Dn, where the …

In the paper, we extend known results concerning crossing numbers for join of graphs of
order six. We give the crossing number of the join product G+ Dn, where the graph G …

The crossing number cr (H) of a graph H is the minimum number of edge crossings over all
drawings of H in the plane. Let H∗ be the connected graph of order five isomorphic to K 5∖ …

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 the paper is to give the …

The main aim of the paper is to establish the crossing numbers of the join products of the
paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the …

C++ Implementation of the Cyclic-Order Graph Algorithm is presented together with the
source code. This program helps in determination of crossing numbers for join products of …