The dispersability of the Kronecker cover of the product of complete graphs and cycles

The Kronecker cover of a graph G is the Kronecker product of G and K 2 . The matching book embedding of a graph G is an embedding of G with the vertices on the spine, each edge within a single page so that the edges on each page do not intersect and the degree of vertices on each page is at most one. The matching book thickness of G is the minimum number of pages in a matching book embeddding of G and it denoted by mbt(G) . A graph G is dispersable if m b t ( G )= Δ ( G ) , nearly dispersable if m b t ( G )= Δ ( G )+1 . In this paper, the dispersability of the Kronecker cover of the Cartesian product of complete graphs K p and cycles C q is determined.