edited by
4,622 views

1 Answer

Best answer
6 votes
6 votes

Eccentricity of Vertex:-The maximum distance between a vertex to all other vertices is considered as the eccentricity of vertex denoted by e(V).The distance from a particular vertex to all other vertices in the graph is taken and among those distances, the eccentricity is the highest of distances.

For this graph

e(a)=5                                e(b)=4                                  e(c)=3                            

e(d)=4                                e(e)=5                                  e(f)=5                            

e(g)=4                                e(h)=3                                  e(i)=4                             

e(j)=5                                 e(k)=4                                  e(l)=5                          

e(m)=4                               e(n)=5   

Radius:-The minimum eccentricity from all the vertices is considered as the radius of the Graph G denoted by r(G). The minimum among all the maximum distances between a vertex to all other vertices is considered as the radius of the Graph G. 

Here 

r(c)=3 and r(h)=3 which is the minimum eccentricity for  c and h.

Center:- If the eccentricity of a graph is equal to its radius, then it is known as the central point of the graph. If

e(V) = r(V),

then ‘V’ is the central point of the Graph ’G’.

Here 

e(c)=r(c)=3                         and e(h)=r(h)=3

Hence,both c and h are center of tree.

Hence,Option(D)c & h is the correct choice.

A good Reference:- Click me 

selected by
Answer:

Related questions

3 votes
3 votes
2 answers
1
go_editor asked Jul 8, 2016
6,587 views
In which tree, for every node the height of its left subtree and right subtree differ almost by 1?Binary Search TreeAVL TreeThreaded Binary TreeComplete Binary Tree
1 votes
1 votes
2 answers
3
makhdoom ghaya asked Sep 5, 2016
4,518 views
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to$n (n – 1)$ $\frac{n(n-1)}{2}$$n^{2}$$n – 1$
2 votes
2 votes
1 answer
4
makhdoom ghaya asked Aug 13, 2016
2,192 views
McCabe’s cyclomatic metric $V(G)$ of a graph $G$ with $n$ vertices, $e$ edges and $p$ connected component is$e$ $n$ $e – n + p$ $e – n + 2p$