Abstract
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(2 m, 2), and full binary trees and binomial trees in G(2 m, 4).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
