MISC

2006年5月15日

On the pagenumber of trivalent Cayley graphs

Discrete Applied Mathematics
  • Yuuki Tanaka
  • ,
  • Yukio Shibata

154
8
開始ページ
1279
終了ページ
1292
記述言語
英語
掲載種別
DOI
10.1016/j.dam.2006.01.001

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. © 2006 Elsevier B.V. All rights reserved.

リンク情報
DOI
https://doi.org/10.1016/j.dam.2006.01.001

エクスポート
BibTeX RIS