| Summary: | 碩士 === 明新科技大學 === 資訊管理研究所 === 99 === The cycle embedding problem in interconnection networks
is an important issue, because it is one of measurements for determining whether the topology of a network is suitable for an application in which embedding rings of various lengths into the topology is required. Embedding cycles of different sizes into a network are benefit to execute parallel programs efficiently. The folded hypercube is a popular network because of its attractive properties. Given an n-dimensional folded hypercube FQn and let e be any edge of FQn. In this paper, we discuss the number of simple k-cycles in FQn, which passing through the edge
e, for k = 4, 6.
|
|---|
