An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph
Joint Authors
Fundikwa, Blessings T.
Mazorodze, Jaya P.
Mukwembi, Simon
Source
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-08-04
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Fundikwa, Blessings T.& Mazorodze, Jaya P.& Mukwembi, Simon. 2020. An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph. Journal of Mathematics،Vol. 2020, no. 2020, pp.1-7.
https://search.emarefa.net/detail/BIM-1188197
Modern Language Association (MLA)
Fundikwa, Blessings T.…[et al.]. An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph. Journal of Mathematics No. 2020 (2020), pp.1-7.
https://search.emarefa.net/detail/BIM-1188197
American Medical Association (AMA)
Fundikwa, Blessings T.& Mazorodze, Jaya P.& Mukwembi, Simon. An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph. Journal of Mathematics. 2020. Vol. 2020, no. 2020, pp.1-7.
https://search.emarefa.net/detail/BIM-1188197
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1188197
