Skip to Main content Skip to Navigation
Journal articles

On size, radius and minimum degree

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-01179221
Contributor : Hélène Lowinger Connect in order to contact the contributor
Submitted on : Wednesday, July 22, 2015 - 9:15:26 AM
Last modification on : Friday, August 5, 2022 - 9:24:30 AM
Long-term archiving on: : Friday, October 23, 2015 - 10:25:12 AM

File

dmtcs-16-1-1.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

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

Share

Metrics