Average Distance and Independence Number

@article{Dankelmann1994AverageDA,
  title={Average Distance and Independence Number},
  author={Peter Dankelmann},
  journal={Discrete Applied Mathematics},
  year={1994},
  volume={51},
  pages={75-83}
}
A sharp upper bound on the average distance of a graph depending on the order and the independence number is given. As a corollary we obtain the maximum average distance of a graph with given order and matching number. All extremal graphs are determined. 
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
23 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Eckenzusammenhang in Graphen

  • P. Dankelmann
  • Diplomarbeit, Aachen
  • 1990

On two conjectures of GRAFFITI

  • S. Fajtlowicz, W. A. Waller
  • Congr. Numer
  • 1986

Mean distance in line graphs

  • F. Buckley
  • Congr. Numer
  • 1981
1 Excerpt

Similar Papers

Loading similar papers…