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

dc.contributor.author | Fundikwa, Blessings T. | |

dc.contributor.author | Mazorodze, Jaya P. | |

dc.contributor.author | Mukwembi, Simon | |

dc.date.accessioned | 2021-02-15T09:15:49Z | |

dc.date.available | 2021-02-15T09:15:49Z | |

dc.date.issued | 2020-08-04 | |

dc.identifier.citation | Fundikwa, B. T., Mazorodze, J. P., & Mukwembi, S. (2020). An Upper Bound on the Radius of a 3-Vertex-Connected-Free Graph. Journal of Mathematics, 2020. | en_ZW |

dc.identifier.issn | 23144629 | |

dc.identifier.uri | https://hdl.handle.net/10646/3964 | |

dc.description | The results in this paper are part of the first author’s MPhilSc thesis. | en_ZW |

dc.description.abstract | Let G=(V,E) be a finite, connected, undirected graph with vertex set V and edge set E. -e distance dG (u,v) between two vertices u, v of G is the length of a shortest u-v path in G.-e eccentricity ec(v)of a vertex v∈V is the maximum distance between v and any other vertex in G. -e value of the minimum eccentricity of the vertices of G is called the radius of G denoted by rad(G). -e degree deg(v)of a vertex v of G is the number of edges incident with v. -e minimum degree δ(G)is the minimum of the degrees of vertices in G.-e open neighbourhood N(v)of a vertex v is the set of all vertices of G adjacent to v. -e closed neighbourhood N[v]of v is the set N(v)∪v{ }. A graph is triangle-free if it does not contain C3 as a subgraph and C4−free if it does not contain C4 as a subgraph. For notions not defined, here we refer the reader to [1]. | en_ZW |

dc.language.iso | en | en_ZW |

dc.publisher | HINDAWI | en_ZW |

dc.subject | 3-vertex-connected | en_ZW |

dc.subject | C4-free graph | en_ZW |

dc.subject | Connectivity measures | en_ZW |

dc.subject | Vertex-connectivity | en_ZW |

dc.subject | Edge-connectivity | en_ZW |

dc.title | An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph | en_ZW |

dc.type | Article | en_ZW |