On the pagenumber of trivalent Cayley graphs

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.     

A fiberwise analogue of the Borsuk-Ulam theorem for sphere bundles over a 2-cell complex II

We describe a finite complex B as I-trivial if there does not exist a Z₂-map from Si−1 to S(α) for any vector bundle α over B and any integer i with i>dimα. We prove that the m-fold suspension of projective plane FP² is I-trivial if and only if m≠0,2,4 for F=C, m≠0,4 for F=H. In the case where F is the Cayley algebra, the m-fold suspension is shown to be I-trivial for every m>0.