Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10331335 | Information Processing Letters | 2005 | 6 Pages |
Abstract
The recursive circulant RC(2n,4) enjoys several attractive topological properties. Let max_ÉG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. In this paper, we show that max_ÉRC(2n,4)(m)=âi=0r(pi/2+i)2pi, where p0>p1>â¯>pr are nonnegative integers defined by m=âi=0r2pi. We then apply this formula to find the bisection width of RC(2n,4). The conclusion shows that, as n-dimensional cube, RC(2n,4) enjoys a linear bisection width.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Xiaofan Yang, David J. Evans, Graham M. Megson,