An upper bound on the radius of a 3-edge-connected graph

被引:0
|
作者
Dankelmann, Peter [1 ]
Mukwembi, Simon [1 ]
Swart, Henda C. [1 ]
机构
[1] Univ KwaZulu Natal, Sch Math Sci, ZA-4041 Durban, South Africa
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let G be a 3-edge-connected graph of order n and radius rad(G). Then the inequality [GRAPHICS] is proved. Moreover, graphs are constructed to show that the bound is asymptotically sharp.
引用
收藏
页码:207 / 215
页数:9
相关论文
共 50 条