The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\) (Q2478173)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5250090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\) |
scientific article; zbMATH DE number 5250090 |
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
0.8689812421798706
0 references
0.8599559664726257
0 references
