Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
An Upper Bound on the Radius of a 3-Vertex-Connected -Free Graph
Journal of Mathematics ( IF 1.3 ) Pub Date : 2020-08-04 , DOI: 10.1155/2020/8367408 Blessings T. Fundikwa 1 , Jaya P. Mazorodze 1 , Simon Mukwembi 2
Journal of Mathematics ( IF 1.3 ) Pub Date : 2020-08-04 , DOI: 10.1155/2020/8367408 Blessings T. Fundikwa 1 , Jaya P. Mazorodze 1 , Simon Mukwembi 2
Affiliation
We show that if is a 3-vertex-connected -free graph of order and radius , then the inequality holds. Moreover, graphs are constructed to show that the bounds are asymptotically sharp.
中文翻译:
3点连通图的半径的上界
我们证明,如果是一个3顶点连接的,自由的阶数和半径图,则不等式持有。此外,构建图以显示边界渐近尖锐。
更新日期:2020-08-04
中文翻译:
3点连通图的半径的上界
我们证明,如果是一个3顶点连接的,自由的阶数和半径图,则不等式持有。此外,构建图以显示边界渐近尖锐。