An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph
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.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2020/8367408 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850109580186484736 |
|---|---|
| author | Blessings T. Fundikwa Jaya P. Mazorodze Simon Mukwembi |
| author_facet | Blessings T. Fundikwa Jaya P. Mazorodze Simon Mukwembi |
| author_sort | Blessings T. Fundikwa |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-485eaa01884346b49698e20a95e757ee |
| institution | OA Journals |
| issn | 2314-4629 2314-4785 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-485eaa01884346b49698e20a95e757ee2025-08-20T02:38:02ZengWileyJournal of Mathematics2314-46292314-47852020-01-01202010.1155/2020/83674088367408An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free GraphBlessings T. Fundikwa0Jaya P. Mazorodze1Simon Mukwembi2Department of Mathematics, University of Zimbabwe, Harare, ZimbabweDepartment of Mathematics, University of Zimbabwe, Harare, ZimbabweSchool of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Durban, South AfricaWe 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.http://dx.doi.org/10.1155/2020/8367408 |
| spellingShingle | Blessings T. Fundikwa Jaya P. Mazorodze Simon Mukwembi An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph Journal of Mathematics |
| title | An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph |
| title_full | An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph |
| title_fullStr | An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph |
| title_full_unstemmed | An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph |
| title_short | An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph |
| title_sort | upper bound on the radius of a 3 vertex connected c4 free graph |
| url | http://dx.doi.org/10.1155/2020/8367408 |
| work_keys_str_mv | AT blessingstfundikwa anupperboundontheradiusofa3vertexconnectedc4freegraph AT jayapmazorodze anupperboundontheradiusofa3vertexconnectedc4freegraph AT simonmukwembi anupperboundontheradiusofa3vertexconnectedc4freegraph AT blessingstfundikwa upperboundontheradiusofa3vertexconnectedc4freegraph AT jayapmazorodze upperboundontheradiusofa3vertexconnectedc4freegraph AT simonmukwembi upperboundontheradiusofa3vertexconnectedc4freegraph |