Embedding trees in recursive circulants
Discrete Applied Mathematics
Disjoint Hamiltonian cycles in recursive circulant graphs
Information Processing Letters
Multiplicative circulant networks topological properties and communication algorithms
Discrete Applied Mathematics
Hamiltonian decomposition of recursive circulant graphs
Discrete Mathematics
Recursive circulants and their embeddings among hypercubes
Theoretical Computer Science
Erratum to "pancyclicity of recursive circulant graphs" [inform. process. lett. 81 (2002) 187-190]
Information Processing Letters
Pancyclicity of recursive circulant graphs
Information Processing Letters
Construction of a Parallel and Shortest Routing Algorithm on Recursive Circulant Networks
HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
Maximum number of edges joining vertices on a cube
Information Processing Letters
Edge-pancyclicity of recursive circulants
Information Processing Letters
Minimum neighborhood in a generalized cube
Information Processing Letters
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d2
Theoretical Computer Science
| Hi-index | 0.89 |
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=0r 2Pi . 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.