Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes

DOI10.1016/J.JDA.2013.07.005zbMath1334.05169OpenAlexW1970659740MaRDI QIDQ396672

Raman Indhumathi, Sheshayya A. Choudum

Publication date: 13 August 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2013.07.005

zbMATH Keywords

hypercubeembeddingcomplete \(k\)-ary treesheight-balanced trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Some properties on Estrada index of folded hypercubes networks ⋮ The Kirchhoff index of some combinatorial networks ⋮ The Kirchhoff index of hypercubes and related complex networks ⋮ Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Longest fault-free paths in hypercubes with vertex faults
• On embedding subclasses of height-balanced trees in hypercubes
• Long paths in hypercubes with conditional node-faults
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Embedding of \(k\)-ary complete trees into hypercubes with uniform load
• Embedding ladders and caterpillars into the hypercube
• Efficient embeddings of ternary trees into hypercubes.
• On cubes and dichotomic trees
• Embedding complete trees into the hypercube

This page was built for publication: Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes