An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph
type: Item
instance of: scholarly article
title: An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph
zbMATH Open document ID: 1489.05040
DOI: 10.1155/2020/8367408
author: Blessings T. Fundikwa
author: Simon Mukwembi
author: J. P. Mazorodze
published in: Journal of Mathematics
publication date: 2021-01-07T00:00:00Z
review text: Summary: We show that if \(G\) is a 3-vertex-connected \(C_4\)-free graph of order \(n\) and radius \(r\), then the inequality \(r\leq(2n/9)+O(1)\) holds. Moreover, graphs are constructed to show that the bounds are asymptotically sharp.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7290905
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2020/8367408
OpenAlex ID: W3047015237
cites work: Radius, diameter, and minimum degree
cites work: Q5442174
cites work: Q3620555
cites work: On the radius of graphs
cites work: An upper bound for the radius of a 3-connected graph
description: scientific article; zbMATH DE number 7290905