Embedding trees in recursive circulants

被引：21

作者：

Lim, HS

Park, JH

Chwa, KY

机构：

[1] KOREA ADV INST SCI & TECHNOL,DEPT COMP SCI,YUSONG GU,TAEJON 305701,SOUTH KOREA

[2] CHONNAM NATL UNIV,DEPT COMP SCI,BUK GU,KWANGJU 500757,SOUTH KOREA

来源：

DISCRETE APPLIED MATHEMATICS | 1996年 / 69卷 / 1-2期

关键词：

D O I：

10.1016/0166-218X(95)00078-6

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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).

引用

页码：83 / 99

页数：17

共 13 条

[1]

[Anonymous], 2001, GRAPH THEORY

[2] STRATEGIES FOR INTERCONNECTION NETWORKS - SOME METHODS FROM GRAPH-THEORY [J].