Now showing items 1-1 of 1

    • 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 ...