The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
1.1k views

Consider the tree given below:

Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree:

  1. d & h
  2. c & k
  3. g, b, c, h, i, m
  4. c & h
asked in DS by Veteran (96.2k points)
retagged by | 1.1k views

1 Answer

+4 votes
Best answer

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 

answered by Boss (40.8k points)
selected by
0
When finding distance..it should be minimum...

Since between two vertices many paths are possible we only select which have minimum weight..

Among all these minimum distances from source to all other vertices maximum taken as eccentricity..
0
Please read given reference carefully.
0
Sir as per given link...

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.

It is number of edges in a shortest path between Vertex U and Vertex V. If there are multiple paths connecting two vertices, then the shortest path is considered as the distance between the two vertices.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,587 questions
54,197 answers
187,535 comments
71,151 users