The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\) (Q2478173)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\) |
scientific article |
Statements
The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\) (English)
0 references
14 March 2008
0 references
The authors show that: \(\text{cr}(K_{2,m}\times P_n)= 2n\lfloor m/2\rfloor\lfloor(m -1)/2\rfloor\), for all \(m\geq 2\) and \(n\geq 1\).
0 references
crossing number
0 references
complete bipartite graph
0 references
path
0 references
Cartesian products
0 references
