| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421035 | Discrete Applied Mathematics | 2006 | 14 Pages |
Abstract
Book embedding of graphs is one of the graph layout problem. It is useful for the multiprocessor network layout or the fault-tolerant processor arrays. We show that the trivalent Cayley graphs proposed by Vadapalli and Srimani can be embedded in five pages, and show some additional results on cube-connected cycles.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yuuki Tanaka, Yukio Shibata,