Embedding trees in recursive circulants Original Research Article

We present the results concerning the embedding of trees into recursive circulants. Recursive circulant G(N, d) is a circulant graph with N vertices and jumps of powers of d. We present dilation 1 embeddings of Fibonacci trees and full quaternary trees in G(2m, 2), and full binary trees and binomial trees in G(2m, 4).