Embedding trees in recursive circulants

Maximum induced subgraph of a recursive circulant

“…Figs. 1(a) and 2(a) show two recursive circulants RC (8,4) and RC(16, 4), respectively. For our purpose, the following recursive definition of RC(2 n , 4) is essential.…”

“…As a result, RC(2 n , 4) has been one potential interconnection network for multicomputer systems. For other related work the reader is referred to [5,6,8,9,12].…”

“…b) illustrates how RC(8,4) is built from four copies of RC(2, 4), whileFig. 2(b)provides a recursive view of RC(16, 4).…”

The super-connected property of recursive circulant graphs

“…1. Several interesting properties of G(2 m , 4) have been studied in the literature [3,[6][7][8]. For example, it was proved by Park and Chwa [7] that G(2 m , 4) is an m connected and Hamiltonian graph.…”

Embedding of Recursive Circulants into Certain Necklace Graphs

“…Since the 1960s, many authors have been concerned with the problems associated with the design and analysis of interconnection networks [2]. One of the most popular interconnection networks is the recursive circulants [3] and has been studied by many authors [2][3][4][5][6][7].…”