An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph

Blessings T. Fundikwa, Jaya P. Mazorodze, Simon Mukwembi and Elena Guardo

Journal of Mathematics, 2020, vol. 2020, 1-7

Abstract: We show that if G is a 3-vertex-connected C4-free graph of order n and radius r, then the inequality r≤2n/9+O1 holds. Moreover, graphs are constructed to show that the bounds are asymptotically sharp.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2020/8367408.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2020/8367408.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:8367408

DOI: 10.1155/2020/8367408

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().