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

  Fundikwa, Blessings T.; Mazorodze, Jaya P.; Mukwembi, Simon (HINDAWI, 2020-08-04)

  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 ...
• Upper Bounds on the Diameter of Bipartite and Triangle-Free Graphs with Prescribed Edge Connectivity 

  Fundikwa, Blessings T.; Mazorodze, Jaya P.; Mukwembi, Simon (HINDAWI, 2020-09-03)

  Graph theory is used to study the mathematical structures of pairwise relations among objects. Mathematically, a pair G=(V,E) is a crisp graph, where V is a nonempty set and E is a relation on V[1]. -e order of a graph G ...
• Spanning paths in graphs 

  Mafuta, Phillip; Mukwembi, Simon; Munyira, Sheunesu (Elsevier, 2018-08-29)

  The Conjecture, Graffiti.pc 190, of the computer program Graffiti.pc, instructed by DeLavi˜na, state that every simple connected graph G with minimum degree δ and leaf number L(G) such that δ ≥ 1 2 (L(G) + 1), is traceable. ...
• Virtual Memorial Service for the Late Professor Rosemary Moyana, PVC Academic Affairs 

  University of Zimbabwe, Media Team (2021-02-12)
• University of Zimbabwe Graduation Ceremony 2020 

  University of Zimbabwe, (UZ) (2020-12-04)

  University of Zimbabwe Graduation Ceremony 2020 was the inaugural virtual ceremony in the face of the COVID-19 pandemic.

View more