On thek-ary hypercube tree and its average distance

DOI10.1080/00207160.2010.544722zbMath1238.05070OpenAlexW2043260883MaRDI QIDQ3101622

Muhammad H. Alsuwaiyel

Publication date: 29 November 2011

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

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

zbMATH Keywords

Wiener indextotal distanceaverage distancehypercube treespanning binomial tree

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees

Cites Work

• Unnamed Item
• Unnamed Item
• On the minimum average distance spanning tree of the hypercube
• Mean distance in a graph
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• On the sum of all distances in a graph or digraph
• On the average distance of the hypercube tree
• 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 thek-ary hypercube tree and its average distance