Radius, diameter and center of graph 
The eccentricity $ecc(v)$ of $v$ in $G$ is the greatest distance from $v$ to any other node.
The radius $rad(G)$ of $G$ is the value of the smallest eccentricity.
The diameter $diam(G)$ of $G$ is the value of the greatest eccentricity.
The center of $G$ is the set of nodes $v$ such that $ecc(v) = rad(G)$

Find the radius, diameter and center of the graph

Appreciate as much help as possible.
I tried following an example and still didn't get it, when you count the distance from a node to another, do you count the starting node too or you count the ending node instead. And when you count, do you count the ones above and below or how do you count? :)
 A: The distance is defined as the number of edges on the shortest path between the vertices. For example, adjacent vertices have a distance of $1$.
In your graph, it might be helpful to explicitly enumerate the eccentricity of each vertex. It is not too difficult to eye-ball the eccentricity for each vertex. I have labelled your graph below with the vertex eccentricities
                                             
You can see that in this graph, the larger eccentricities occur at the sides of the graph, with the largest (the diameter) being $6$. The smallest eccentricity occurs at the central vertex with an eccentricity of $3$. This is your radius. Your center consists of all the vertices which have eccentricity equal to the radius, in this case $3$. For this graph, there is only a single such vertex, so your center in the single vertex labelled $3$ in the graph.
You can see that the name center really is quite aptly named. The vertices of the center minimizes the maximum distance to any vertex of the graph and in this sense, really are the most central vertices in the graph.
A: I think for the path graph  Pn, the diameter is n−1.But the radius is (n-1/2)rounded up to the nearest integer.
For example,P3 it has radius of 1 but not 2.
A: to find  the  radius of  aconnected  graph  G 
 denoted by r=[v+e]÷[e-2]
       where v=vertex of the graph
                  e=edge of the graph 
