We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The dispersability of the Kronecker cover of the product of complete graphs and cycles.
- Authors
Zeling Shao; Yaqin Cui; Zhiguo Li
- Abstract
The Kronecker cover of a graph G is the Kronecker product of G and K2. 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 mbt(G) = Δ(G), nearly dispersable if mbt(G) = Δ(G)+1. In this paper, the dispersability of the Kronecker cover of the Cartesian product of complete graphs Kp and cycles Cq is determined.
- Subjects
KRONECKER products; COMPLETE graphs; SPINE
- Publication
Electronic Journal of Graph Theory & Applications, 2024, Vol 12, Issue 1, p117
- ISSN
2338-2287
- Publication type
Article
- DOI
10.5614/ejgta.2024.12.1.10