On size, radius and minimum degree
2014 ◽
Vol Vol. 16 no. 1
(Graph Theory)
◽
Keyword(s):
Graph Theory International audience 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.
2019 ◽
Vol 29
(1)
◽
pp. 128-136
◽
Keyword(s):
2013 ◽
Vol Vol. 15 no. 1
(Graph Theory)
◽
Keyword(s):
2021 ◽
Vol vol. 23 no. 1
(Graph Theory)
◽
Keyword(s):
Keyword(s):
2012 ◽
Vol Vol. 14 no. 2
(Graph Theory)
◽
Keyword(s):
2014 ◽
Vol Vol. 16 no. 3
◽
Keyword(s):
2012 ◽
Vol 87
(2)
◽
pp. 255-271
◽
Keyword(s):
2013 ◽
Vol Vol. 15 no. 2
(Graph Theory)
◽
Keyword(s):