On the pagenumber of trivalent Cayley graphs |
| |
| Authors: | Yuuki Tanaka Yukio Shibata |
| |
| Institution: | Department of Computer Science, Gunma University, 1-5-1 Tenjin-cho, Kiryu, Gunma 376-8515, Japan |
| |
| 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: | Trivalent Cayley graph Book embedding Cube-connected cycles |
| 本文献已被 ScienceDirect 等数据库收录！ |
