On the average distance of the hypercube tree

DOI10.1080/00207160802195415zbMath1203.05039OpenAlexW2080560180MaRDI QIDQ3568450

Muhammad 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

Wiener indextotal distanceaverage distanceaverage delayhypercube tree

Mathematics Subject Classification ID

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

Related Items (1)

On thek-ary hypercube tree and its average distance

Cites Work

• Unnamed Item
• Mean distance in a graph
• Computing the average distance of an interval graph
• On the sum of all distances in a graph or digraph
• The complexity of the network design problem
• Light graphs with small routing cost
• MLH: A hierarchical hypercube network
• Wiener index of trees: Theory and applications

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