On the average path length of complete m-ary trees

zbMATH Open1297.05077MaRDI QIDQ2877892FDOQ2877892

Authors: Michael A. Nyblom 

Publication date: 28 August 2014

Published in: Journal of Integer Sequences (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/JIS/VOL17/Nyblom/nyblom22.html

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The average path length and link efficiency of a balanced \(k\)-ary tree
• scientific article; zbMATH DE number 3858431
• Summing the shortest path lengths in a rectangular lattice via recursion
• On the average internal path length of m-ary search trees
• The average diameter of general tree structures

zbMATH Keywords

Wiener indexaverage path length\(m\)-ary tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cited In (5)

• Title not available (Why is that?)
• On thek-ary hypercube tree and its average distance
• The average diameter of general tree structures
• On the number of \(t\)-ary trees with a given path length
• On the average length of lexicographic paths

This page was built for publication: On the average path length of complete \(m\)-ary trees

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