Average distance in weighted graphs
From MaRDI portal
Publication:658013
DOI10.1016/J.DISC.2011.02.010zbMath1238.05071OpenAlexW2028522333MaRDI QIDQ658013
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
Related Items (12)
A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ On a quadratic programming problem involving distances in trees ⋮ Variance and Covariance of Distributions on Graphs ⋮ On the Wiener index, distance cospectrality and transmission-regular graphs ⋮ On solving a non-convex quadratic programming problem involving resistance distances in graphs ⋮ Continuous mean distance of a weighted graph ⋮ Mean distance on metric 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 ⋮ Total distance, Wiener index and opportunity index in wreath products of star graphs ⋮ DEGREE DISTANCE AND MINIMUM DEGREE ⋮ On average distance in tournaments and Eulerian digraphs
Cites Work
- Unnamed Item
- 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
- Distance in graphs
- Spanning Trees and Optimization Problems
- Average distance, minimum degree, and spanning trees
This page was built for publication: Average distance in weighted graphs