| Presentation | 2003/11/18 On the pagenumber of trivalent Cayley graphs Yuuki TANAKA, Yukio SHIBATA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Book embedding of graphs is one of the graph layout problems. It is useful for the multiprocessor network layout or the fault-tolerant processor arrays. We show that trivalent Cayley graphs proposed by P. Vadpalli and P. K. Srimani can be embedded in 5 pages, and show some additional results on cube-connected cycles. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Trivalent Cayley graph / Book embedding / Cube-connected cycles |
| Paper # | COMP2003-54 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2003/11/18(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On the pagenumber of trivalent Cayley graphs |
| Sub Title (in English) | |
| Keyword(1) | Trivalent Cayley graph |
| Keyword(2) | Book embedding |
| Keyword(3) | Cube-connected cycles |
| 1st Author's Name | Yuuki TANAKA |
| 1st Author's Affiliation | Department of Computer Science, Gunma University() |
| 2nd Author's Name | Yukio SHIBATA |
| 2nd Author's Affiliation | Department of Computer Science, Gunma University |
| Date | 2003/11/18 |
| Paper # | COMP2003-54 |
| Volume (vol) | vol.103 |
| Number (no) | 468 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |