Embedding certain height-balanced trees and complete p^m-ary trees into hypercubes
From MaRDI portal
(Redirected from Publication:396672)
Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes
Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes
Recommendations
Cites work
- scientific article; zbMATH DE number 15360 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 4185639 (Why is no real title available?)
- Efficient embeddings of ternary trees into hypercubes.
- Embedding complete trees into the hypercube
- Embedding height balanced trees and Fibonacci trees in hypercubes
- Embedding ladders and caterpillars into the hypercube
- Embedding of \(k\)-ary complete trees into hypercubes with uniform load
- Long paths in hypercubes with conditional node-faults
- Longest fault-free paths in hypercubes with vertex faults
- On cubes and dichotomic trees
- On embedding subclasses of height-balanced trees in hypercubes
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)
