Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Computer Engineering and Technology, 3rd (ICCET 2011)
By
Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
ISBN:
9780791859735
No. of Pages:
970
Publisher:
ASME Press
Publication date:
2011

Cycle embedding is an important issue in interconnection networks. Embedding cycles of different sizes into a network are beneficial to the efficient execution of parallel programs. The hypercube is a popular network because of its attractive properties. Given an n-dimensional hypercube Qn and let e be any edge of Qn. In this paper, we discuss the number of simple k-cycles in Qn, which pass through the edge e for k=4,6,and8.

Abstract
Key Words
1. Introduction
2. Preliminaries
3. Main Result
4. Conclusions
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal