Simon Mukwembi - On size, radius and minimum degree

dmtcs:1265 - Discrete Mathematics & Theoretical Computer Science, January 17, 2014, vol. 16:1 - https://doi.org/10.46298/dmtcs.1265
On size, radius and minimum degreeArticle

Authors: Simon Mukwembi 1

Graph Theory

[en]
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.

https://doi.org/10.46298/dmtcs.1265
Source: HAL:hal-01179221v1
Volume: vol. 16:1
Section: Graph Theory
Published on: January 17, 2014
Imported on: February 9, 2012
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Discrete Mathematics, graph theory
Licence: Hal authorisation v1

Share and export

Consultation statistics

This page has been seen 730 times.
This article's PDF has been downloaded 1177 times.