Embedding trees in recursive circulants (Q1923603)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Embedding trees in recursive circulants |
scientific article; zbMATH DE number 933116
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding trees in recursive circulants |
scientific article; zbMATH DE number 933116 |
Statements
Embedding trees in recursive circulants (English)
0 references
13 April 1997
0 references
A recursive circulant \(G(N,d)\) is a circulant graph with \(N\) vertices and jumps of powers of \(d\). The authors construct dilation 1 embeddings (i.e. realizations as subgraphs) of Fibonacci trees and quaternary trees in \(G(2^m,2)\) and of full binary trees and binomial trees in \(G(2^m,4)\).
0 references
recursive circulant
0 references
circulant graph
0 references
embeddings
0 references
Fibonacci trees
0 references
quaternary trees
0 references
binary trees
0 references
binomial trees
0 references
0 references
0.90364796
0 references
0.90268314
0 references
0 references
0 references
0.8905591
0 references
0.8896916
0 references
