Embedding trees in recursive circulants

DOI10.1016/0166-218X(95)00078-6zbMath0860.05024OpenAlexW1981743008MaRDI QIDQ1923603

Jung-Heum Park, Kyung-Yong Chwa, Hyeong-Seok Lim

Publication date: 13 April 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

embeddingsbinary treescirculant graphbinomial treesrecursive circulantFibonacci treesquaternary trees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

The super-connected property of recursive circulant graphs ⋮ Complete binary trees embeddings in Möbius cubes ⋮ The (strong) rainbow connection numbers of Cayley graphs on abelian groups ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ Wiener Index of Hypertree ⋮ Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) ⋮ Recursive circulants and their embeddings among hypercubes ⋮ Maximum induced subgraph of a recursive circulant ⋮ Hamiltonian properties on a class of circulant interconnection networks ⋮ Pancyclicity of recursive circulant graphs

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Recursive circulants and their embeddings among hypercubes
• Efficient Embeddings of Trees in Hypercubes
• Implementation and Analysis of Binomial Queue Algorithms
• A general class of invulnerable graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH