Thank you for the video. Please I need a video of the below question. Given a connected graph G. For each vertex v, we define the eccentricity as ε(v) = max{distG(v, x) : x ∈ V (G)}. The radius of G is defined as rad(G) = min{ε(v) : v ∈ V (G)}. We define the center C(G) to be a set of vertices v with ε(v) = rad(G). Give a non-inductive proof that in any tree T, the center of T consists either of a single vertex or two adjacent vertices. Here, you need to give a non-inductive proof.)
Let T be a tree of order 3 or more, and let T′ be the tree obtained from T by deleting its end-vertices. (a) Show that diam(T) = diam(T′) + 2, rad(T) = rad(T′) + 1 and Cen( T) = Cen (T')... Sir please solve this
Very nice explanation of all algorithms without skipping even the smallest step. Truly suitable for the first time learners too
Thanku soo much sir ...me ny bohat sari videos dekhi hn pr sb sy zaida explain kr ky ap ny hi btaya ha ..shukar smjh aa gai mujhy ...thank u soo much
Great Sir, i was too confused about eccentricity you made it too easy thanks a lot
thank you sir, clear explanation!
Very helpful sir thank you so much sir God bless you sir
your whole graph theory explanation is very good and keep it up!
Thank you so much sir for good explanation sir , now I am understanding this concept
Simple and precise. Thanks a lot.
Your teaching techniques are really good,,
Dil jeet liya sir ❤️❤️❤️
1.5x speed is the best for this video. Thanks for the amazing explanation.
Thank u sir. It's really easy to understand
Really really helpful❤️
thanks man !!! beautifully explained !
Clear explanation Sir
Thank you for the video.
Please I need a video of the below question.
Given a connected graph G. For each vertex v, we define the eccentricity as
ε(v) = max{distG(v, x) : x ∈ V (G)}.
The radius of G is defined as rad(G) = min{ε(v) : v ∈ V (G)}. We define the center C(G) to be
a set of vertices v with ε(v) = rad(G). Give a non-inductive proof that in any tree T, the center of
T consists either of a single vertex or two adjacent vertices. Here, you need to give a non-inductive proof.)
nice and easiest explanation sir. thank you :)
Thank you sir , this is very helpful video
Thankuuuu so much ...bahut simply clear kiya h aapne ye topic
Nice explanation 👏
Good explanation.Thanks
Clear explanation Sir... thank u Sir...Sir, Can u plz make a video regarding planarity, thickness, crossing and outerplanarity.
Thanks dude very good explanation
It was clear and understandable thankyou!!!
great explanation sir.
very helpful.
i instantly subscribed your channel.
thanx for this video, its easy to understand.
Thank you sir. You explained this graphs such that me also understandable. It's very useful sir.
You are most welcome
Thank u very much very helpful
Thank u very muchh very helpful
very useful video
Nice video
thank u dude!!
thank you for excplation , but in min 10 : 22 , the Eccentricity from F to E = 2
Distance*
Really good
Outstanding
Thanks u so much sir
Thankyou sir!!
thanks a bunch
thank you sir well explained
Thanq 🤓♥️
thank you sir
Thankyou sir 🙏🙏🙏
Fab explaination...❤️
edugorilla ka package mila hai
Thanku soo much sir
Thank you 💗 sir
thank u sir
Ty
Thankyou sir
Thanks
👍
I dont see further videos on euler graphs and eccentricty ?? I am missing something here
Sir is this terms meaning same fr tree also?????
Please make video on expression tree also
Tq sir
Thank u m8
Question in Tree traversal if two order is given and asking third order
Good
Pls make a video on measure theory
How to find centre
Generating function and recurrence relation plzzz
Want a Dijkstra's algorithm
Let T be a tree of order 3 or more, and let T′ be the tree obtained from T by deleting its end-vertices. (a) Show that diam(T) = diam(T′) + 2, rad(T) = rad(T′) + 1 and Cen( T) = Cen (T')...
Sir please solve this
Where is Lec 16 sir
thanks Sir
Thank you sir
thank u sir
Tq sir
Tq sir