A Conjecture on Average Distance and Diameter of a Graph

@article{Wu2011ACO,
  title={A Conjecture on Average Distance and Diameter of a Graph},
  author={Baoyindureng Wu and Guojie Liu and Xinhui An and Guiying Yan and Xiaoping Liu},
  journal={Discrete Math., Alg. and Appl.},
  year={2011},
  volume={3},
  pages={337-342}
}
Using Ore’s structural characterization on diameter-maximal graphs, we determine the extremal graphs with the minimum average distance among the graphs with given order and diameter, thereby solving a conjecture of Aouchiche and Hansen [Automated results and conjectures on average distance in graphs, in Graph Theory in Paris, eds. A. Bondy, J. Fonlupt, J.-L… CONTINUE READING