Embedding trees in recursive circulants (Q1923603): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q589833
Property / reviewed by
 
Property / reviewed by: Stelian Mihalas / rank
Normal rank
 

Revision as of 17:04, 19 February 2024

scientific article
Language Label Description Also known as
English
Embedding trees in recursive circulants
scientific article

    Statements

    Embedding trees in recursive circulants (English)
    0 references
    0 references
    0 references
    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

    Identifiers