On size, radius and minimum degree

Simon Mukwembi (1)

1 UKZN - University of KwaZulu-Natal [Durban, Afrique du Sud]

Let G be a finite connected graph. We give an asymptotically tight upper bound on the size of G in terms of order, radius and minimum degree. Our result is a strengthening of an old classical theorem of Vizing (1967) if minimum degree is prescribed.

Mots clés: Discrete Mathematics; graph theory

Domaines: Mathématique discrète [cs.DM]

Simon Mukwembi. On size, radius and minimum degree. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.1--5. ⟨10.46298/dmtcs.1265⟩. ⟨hal-01179221⟩