Embedding Full Ternary Trees into Recursive Circulants

Authors:
Cheol Kim;Jung Choi;Hyeong-Seok Lim
Affiliations:
-;-;-
Venue:
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Year:
2002

Citing 9
Cited 0

Strategies for interconnection networks: some methods from graph theory

Journal of Parallel and Distributed Computing
Algorithms in C

Algorithms in C
On embedding binary trees into hypercubes

Journal of Parallel and Distributed Computing
A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube

Journal of Algorithms
Embedding an Arbitrary Binary Tree into the Star Graph

IEEE Transactions on Computers
Embedding trees in recursive circulants

Discrete Applied Mathematics
Disjoint Hamiltonian cycles in recursive circulant graphs

Information Processing Letters
Embedding complete trees into the hypercube

Discrete Applied Mathematics
Hamiltonian Decomposition of Recursive Circulants

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

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.