Stellenbosch University
Average distance, minimum degree, and irregularity
index
Simon Mukwembi, University of the
Witwatersrand
SAMS Subject Classification Number: 6
We give an upper bound on the average distance of a connected graph of given order and minimum degree where irregularity index is prescribed. Our results are a strengthening of the classical theorems by Dankelmann and Entringer [1], and by Kouider and Winkler [2], on average distance and minimum degree if the number of distinct terms in the degree sequence of the graph is prescribed.
References
[1] P. Dankelmann and R.C. Entringer, Average distance, minimum degree and spanning trees, J. Graph Theory 33 (2000) 1–13.
[2] M. Kouider and P. Winkler, Mean distance and minimum degree, J. Graph Theory 25 (1997) 95-99.
