Average distance in weighted graphs

DOI10.1016/j.disc.2011.02.010zbMath1238.05071MaRDI QIDQ658013

Peter Dankelmann

Publication date: 11 January 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.02.010

zbMATH Keywords

weight function; average distance of graphs

Mathematics Subject Classification ID

05C12: Distance in graphs

05C22: Signed and weighted graphs

Related Items

DEGREE DISTANCE AND MINIMUM DEGREE, On a quadratic programming problem involving distances in trees, Total distance, Wiener index and opportunity index in wreath products of star graphs, On solving a non-convex quadratic programming problem involving resistance distances in graphs, On the Wiener index, distance cospectrality and transmission-regular graphs, Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes, Improved bounds on the difference between the Szeged index and the Wiener index of graphs, A survey of the all-pairs shortest paths problem and its variants in graphs

Cites Work

• Spanning trees with many leaves and average distance
• Mean distance in a graph
• Computing the average distance of an interval graph
• On the sum of all distances in a graph or digraph
• Average distance and vertex-connectivity
• Spanning Trees and Optimization Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item