• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.249-254
• /
• 2007

In this paper, we consider the embedding problem of postorder Fibonacci circulant. We show that Fibonacci linear array, Fibonacci mesh, Fibonacci tree, Fibonacci cubes and Hypercube are a subgraph of postorder Fibonacci circulant.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.163-166
• /
• 2004

In this paper, we consider the embedding problem of postorder Fibonacci circulants. We show that Fibonacci cubes and Hypercube are a subgraph of postorder Fibonacci circulants. And the postorder Fibonacci circulants of order n can be embedded into the Fibonacci cubes of order n with expansion 1, dilation n-2 and congestion O (n-1), the Hypercube of order n-2 with expansion $\frac{f_n}{2^{n-2}}$, dilation n-2 and congestion O(n-2).

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.169-172
• /
• 2002

In this paper, we consider the problem of embedding Fibonacci linear array, Fibonacci mesh, Fibonacci tree into Fibonacci circulants and between Fibonacci cubes and Fibonacci circulants. We show that the Fibonacci linear array of order n , Ln is a subgraph of the Fibonacci circulants of order n , En with En◎ Ln,n≥0 , the Fibonacci mesh of order (nt,n2), M(n,.nT)with S2n.1 f( M(n.れ)닌 M(n.1.n.1)), 52れ 늰( M(n.n.1)띤 M(H.n-1)) and the Fibonacci tree-lof order n, FT/sub n/ with ∑/sub n+3/⊇ FTn , n≥0, the Fibonacci tree-ll of order n , Tれ with ∑/sub n/⊇ Tn Fu퍼hermore, 낀e show that the Fibonacci cubes of order n , rn is subgraph of the Fibonacci circulants of order n , En and inversely rn can be embedded into En with expansion 1, dilation n -2 and congestion.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.27-34
• /
• 2008

In this paper, We propose a new parallel computer topology, called the Postorder Fibonacci Circulants and analyze its properties. It is compared with Fibonacci cubes, when its number of nodes is kept the same of comparable one. Its diameter is improved from n-2 to $[\frac{n}{3}]$ and its topology is changed from asymmetric to symmetric. It includes Fibonacci cube as a spanning graph.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.91-94
• /
• 2004

In this paper, we propose a new parallel computer topology, called the postorder Fibonacci circulants and analyze its properties. It is compared with Fibonacci cubes, when its number of nodes and its degree is kept the same of comparable one. Its diameter is improved from n-2 to [$\frac{n}{3}$] and a its topology is changed from asymmetric to symmetric. It includes Fibonacci cube as a spanning tree.