1. P. Dankelmann, G. Dlamini, H.C. Swart, Upper bounds on distance measures in K2,l-free graphs (submitted for publication).
2. The number of edges in a bipartite graph of given radius;Dankelmann;Discrete Math.,2011
3. G. Dlamini, Aspects of distances in graphs, Ph.D. Thesis, University of Natal, Durban, 2003.
4. Radius of (2k−1)-connected graphs;Egawa;Ars Combin.,1999
5. Radius, diameter, and minimum degree;Erdös;J. Combin. Theory Ser. B,1989