On thek-ary hypercube tree and its average distance
From MaRDI portal
Publication:3101622
Recommendations
- On the average distance of the hypercube tree
- On the minimum average distance spanning tree of the hypercube
- Bounds of the average distance of trees and graphs
- scientific article; zbMATH DE number 15360
- Short proofs of some theorems on bounds of the average distances of trees
- On the average path length of complete m-ary trees
- Sums of distances between vertices/leaves in k-ary trees
- scientific article; zbMATH DE number 1161316
- Embedding of \(k\)-ary complete trees into hypercubes with uniform load
- The treewidth and pathwidth of hypercubes
Cites work
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- Light graphs with small routing cost
- Mean distance in a graph
- MLH: A hierarchical hypercube network
- On the average distance of the hypercube tree
- On the minimum average distance spanning tree of the hypercube
- On the sum of all distances in a graph or digraph
- Wiener index of trees: Theory and applications
Cited in
(4)- On average and typical values of sums of pairwise distances for subsets of vertices of the n-dimensional unit cube
- On the average distance of the hypercube tree
- On spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
This page was built for publication: On thek-ary hypercube tree and its average distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101622)
