Minimum size of a graph or digraph of given radius

被引：8
|
作者：
Dankelmann, Peter [1 ]
Volkmann, Lutz [2 ]
机构：
[1] Univ KwaZulu Natal, Sch Math Sci, ZA-4000 Durban, South Africa
[2] Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany
来源：
INFORMATION PROCESSING LETTERS | 2009年 / 109卷 / 16期
关键词：
Interconnection networks; Graph; Digraph; Radius; Minimum degree; Size;
D O I：
10.1016/j.ipl.2009.06.001
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we show that a connected graph of order n, radius r and minimum degree delta has at least 1/2 (delta n + (n-1)(delta-2)/(delta-1)(r)-1) edges, for n large enough, and this bound is sharp. We also present a similar result for digraphs. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：971 / 973
页数：3
相关论文
共 50 条
12345