Mean distance in a tree

DOI10.1016/0166-218X(90)90137-2zbMath0742.05032MaRDI QIDQ1813712

Peter M. Winkler

Publication date: 25 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

mean distance

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (9)

Computing the average distance of an interval graph ⋮ A Wiener-type graph invariant for some bipartite graphs ⋮ On the total distance between nodes in tournaments ⋮ Wiener index of graphs with fixed number of pendant or cut-vertices ⋮ Extremal values for ratios of distances in trees ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ The \(\rho\)-moments of vertex-weighted graphs ⋮ Wiener index of graphs with more than one cut-vertex ⋮ The sum of the squares of the parts of a partition, and some related questions

Uses Software

• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mean distance in a graph
• The sum of the squares of the parts of a partition, and some related questions
• On the sum of all distances in a graph or digraph
• Average distance in graphs with removed elements
• Existence of graphs with prescribed mean distance
• The average distance and the independence number

This page was built for publication: Mean distance in a tree