Embedding certain height-balanced trees and complete p^m-ary trees into hypercubes
From MaRDI portal
Publication:396672
DOI10.1016/J.JDA.2013.07.005zbMATH Open1334.05169OpenAlexW1970659740MaRDI QIDQ396672FDOQ396672
Authors: Raman Indhumathi, S. 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
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Long paths in hypercubes with conditional node-faults
- Title not available (Why is that?)
- Longest fault-free paths in hypercubes with vertex faults
- Embedding ladders and caterpillars into the hypercube
- Embedding complete trees into the hypercube
- Title not available (Why is that?)
- On embedding subclasses of height-balanced trees in hypercubes
- Embedding height balanced trees and Fibonacci trees in hypercubes
- Embedding of \(k\)-ary complete trees into hypercubes with uniform load
- Efficient embeddings of ternary trees into hypercubes.
- On cubes and dichotomic trees
- Title not available (Why is that?)
Cited In (9)
- The Kirchhoff index of some combinatorial networks
- Some properties on Estrada index of folded hypercubes networks
- On embedding subclasses of height-balanced trees in hypercubes
- Embedding height balanced trees and Fibonacci trees in hypercubes
- The Kirchhoff index of hypercubes and related complex networks
- Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network
- Embedding complete trees into the hypercube
- Optimal embeddings of generalized ladders into hypercubes
- Certain AVL subgraphs of ternary cubes
This page was built for publication: Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396672)
