The crossing numbers of Cartesian product of cone graph \(C_{m}+K_l\) with path \(P_{n}\). (Q2881277)

A crossing number \(cr(G)\) of a graph \(G\) is the minimal number of crossings in any drawing of the graph in the plane. The authors study the crossing number of a particular family of graphs: Let \(W_{l,m}\) be the graph obtained from \(C_m\) by adding \(l\) vertices connected to every vertex of the cycle and let \(\square \) denote the cartesian product. The authors show that NEWLINENEWLINE\[NEWLINE\begin{multlined}NEWLINEcr(W_{l,m}\square P_n) \leq NEWLINE(n-1) \left( \left\lfloor {\frac {l+2}{2}} \right\rfloor \left\lfloor {\frac {l+1}{2}} \right\rfloor \left\lfloor {\frac {m+2}{2}} \right\rfloor \left\lfloor {\frac {m+1}{2}}\right\rfloor -lm + l \right) +\\NEWLINE+2\left( \left\lfloor {\frac {l}{2}} \right\rfloor \left\lfloor {\frac {l+1}{2}} \right\rfloor \left\lfloor {\frac {m}{2}} \right\rfloor \left\lfloor {\frac {m+1}{2}}\right\rfloor - \left\lfloor {\frac {l}{2}} \right\rfloor \left\lfloor {\frac {m}{2}}\right\rfloor + \left\lfloor {\frac {l+1}{2}}\right\rfloor \right).NEWLINE\end{multlined}NEWLINE\]NEWLINENEWLINEAs a main result they show equality in this bound for \(l=1\) and \(l=2\). They conjecture that equality hold for every values of \(l\), \(m\), and \(n\).