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.

Source : oai:HAL:hal-01179221v1

Volume: Vol. 16 no. 1 (in progress)

Section: Graph Theory

Published on: January 17, 2014

Submitted on: February 9, 2012

Keywords: Discrete Mathematics, graph theory,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 44 times.

This article's PDF has been downloaded 79 times.