On the average distance of the hypercube tree

DOI10.1080/00207160802195415MaRDI QIDQ3568450zbMATH OpenOpenAlexFDO

Authors M. H. Alsuwaiyel

Publication date 11 June 2010

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160802195415

zbMATH Keywords

average delayaverage distancehypercube treetotal distanceWiener index

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Recommendations

• On thek-ary hypercube tree and its average distance
• On the minimum average distance spanning tree of the hypercube
• scientific article; zbMATH DE number 140089
• Spanning subgraphs of a hypercube. IV: Rooted trees
• Bounds of the average distance of trees and graphs

Cites work

• Computing the average distance of an interval graph
• scientific article; zbMATH DE number 4074878 (Why is no real title available?)
• Light graphs with small routing cost
• Mean distance in a graph
• MLH: A hierarchical hypercube network
• On the sum of all distances in a graph or digraph
• The complexity of the network design problem
• Wiener index of trees: Theory and applications

Cited in

(5)

• Average distances on substitution trees
• On thek-ary hypercube tree and its average distance
• scientific article; zbMATH DE number 140089 (Why is no real title available?)
• AVERAGE FERMAT DISTANCE OF A FRACTAL TREE
• On the minimum average distance spanning tree of the hypercube

This page was built for publication: On the average distance of the hypercube tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568450)