Eccentricity of a vertex , Radius and Diameter of a Graph with example | Graph Theory #15

[@dhirendraswami9688]

Very nice explanation of all algorithms without skipping even the smallest step. Truly suitable for the first time learners too

[@aliyanahmed9566]

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

[@MathsWhisperer]

Great Sir, i was too confused about eccentricity you made it too easy thanks a lot

[@tanishqsharma3990]

Dil jeet liya sir ❤️❤️❤️

[@elphordkudzai193]

thank you sir, clear explanation!

[@SHENUM.]

Really really helpful❤️

[@deepikadagarharyana9125]

Thankuuuu so much ...bahut simply clear kiya h aapne ye topic

[@aniruddhyadav430]

Clear explanation Sir

[@nothingeverything1746]

Thanks, helpful video.

[@shivamkumarsingh1420]

your whole graph theory explanation is very good and keep it up!

[@trishitakesarwani6439]

Nice explanation 👏

[@serventofgod7161]

Very helpful sir thank you so much sir God bless you sir

[@itsruju2545]

Thank u very much very helpful

[@zyro9922]

Simple and precise. Thanks a lot.

[@tatendamukonoweshuro3008]

Thank you so much sir for good explanation sir , now I am understanding this concept

[@atrsankaralingamvalarmathi3]

Clear explanation Sir... thank u Sir...Sir, Can u plz make a video regarding planarity, thickness, crossing and outerplanarity.

[@ummahafsa6090]

Your teaching techniques are really good,,

[@itzboyon6983]

1.5x speed is the best for this video. Thanks for the amazing explanation.

[@nimeshranatunge734]

very useful video

[@architabhanja3889]

Fab explaination...❤️

[@deepakjoshi7349]

edugorilla ka package mila hai

[@usmanimtiaz1519]

Thanks dude very good explanation

[@Sanakhan-ff2jd]

thanks man !!! beautifully explained !

[@bishalkarki8178]

Good explanation.Thanks

[@VishwaShah-wz6gx]

It was clear and understandable thankyou!!!

[@misskomal6808]

Nice video

[@MathwithWaqasShah]

great explanation sir.
very helpful.
i instantly subscribed your channel.

[@21-yashdusane42]

thanx for this video, its easy to understand.

[@sapnavishwakarma2913]

Sir is this terms meaning same fr tree also?????

[@patheypandya]

Outstanding

[@atulshewale9389]

Thank you 💗 sir

[@amriteshsingh7123]

Thankyou sir!!

[@shirinesimon]

Thank u sir. It's really easy to understand

[@hrishikeshbodkhe4282]

nice and easiest explanation sir. thank you :)

[@aravindbalakrishnan4254]

Thank you sir. You explained this graphs such that me also understandable. It's very useful sir.

[@vivekanandkhyade]

You are most welcome

[@technologytech5883]

Please make video on expression tree also

[@kamaldaghstani2644]

thank you for excplation , but in min 10 : 22 , the Eccentricity from F to E = 2

[@sahilprasantachoudhury911]

Distance*

[@akshayravi8637]

thank you sir well explained

[@aatikabilal7713]

Thank you sir , this is very helpful video

[@yashwant369]

Thanq 🤓♥️

[@shivadeepthitoopran243]

I dont see further videos on euler graphs and eccentricty ?? I am missing something here

[@kavyalalu1227]

Really good

[@nageshshyanubhag6399]

Pls make a video on measure theory

[@rexfordboakye5312]

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

[@yogeshmangate3641]

Thanks u so much sir

[@lapepitadeorooficial]

thanks a bunch

[@kiranchudhry7502]

Where is Lec 16 sir

[@kokilarajan6633]

👍

[@studyteacher2198]

Good

[@bulidiriba4598]

thank u dude!!

[@sagarpatil-js1fy]

thank u sir

[@prayagraj999]

thanks Sir

[@unknownuser-ju1xc]

Thanks

[@smitkalsa6148]

Want a Dijkstra's algorithm

[@alkasharma2440]

Question in Tree traversal if two order is given and asking third order

[@kutibanu1078]

Tq sir

[@champagnepapi8363]

Thank u m8

[@45-shafeerahamed81]

Generating function and recurrence relation plzzz

[@lavishkothari9363]

Ty

[@ujjawalvishal7582]

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

[@itsruju2545]

Thank u very muchh very helpful

[@Khankhan-pz4dw]

Thanku soo much sir

[@alkasharma2440]

Thank you sir

[@Smngolitottu]

Tq sir

[@akshayp503]

thank u sir

[@jaysahu357]

thank you sir

[@ssumithradevi2299]

Tq sir

[@Myiasofficerdream]

Thankyou sir 🙏🙏🙏

[@KAREN-ye5pf]

Thankyou sir