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

被引：0
|
作者：
Fundikwa, Blessings T. [1 ]
Mazorodze, Jaya P. [1 ]
Mukwembi, Simon [2 ]
机构：
[1] Univ Zimbabwe, Dept Math, Harare, Zimbabwe
[2] Univ KwaZulu Natal, Sch Math Stat & Comp Sci, Durban, South Africa
来源：
AFRIKA MATEMATIKA | 2021年 / 32卷 / 3-4期
关键词：
Radius; Edge-connectivity;
D O I：
10.1007/s13370-020-00837-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We give an upper bound on the radius of a C-4-free graph in terms order and edge-connectivity. In particular we show that if G is a 3-edge-connected C-4-free graph of order n and radius r, then the inequality r <= n/4 + 58/4 holds. Moreover, graphs are constructed to show that the bounds are asymptotically sharp.
引用
收藏
页码：467 / 474
页数：8
相关论文
共 50 条
12345