On the Page Number of Triple-Loop Networks with Even Cardinality

Abstract

A book-embedding of a graph \(G\) consists of placing the vertices of \(G\) on a spine and assigning edges of the graph to pages so that edges assigned to the same page without crossing. In this paper,we propose schemes to embed the connected triple-loop networks with even cardinality in books, then we give upper bounds of page number of some multi-loop networks.