Embedding Full Ternary Trees into Recursive Circulants

Abstract

Recursive circulant G(N,d) is a circulant graph with N vertices and jumps of power of d. In this paper we show that k level full ternary trees whose number of vertices are not more than N can be embedded into recursive circulants G(N,2) and G(N,3) with dilation 2.