one of the most difficult topic and bahut ache se explain kya aapne.. one of the best lecture ✍🙏
@kavitarani29258 ай бұрын
Bahut hi jyada sekhne ko Mila sir first time ye model pada hai sir puri treh se smajh aaya or ab yha se koi questions wrong nhi hoga , thank you sir 🎉🎉❤❤❤❤❤❤
@curlyworld43657 ай бұрын
Thank you sir 😊❤
@Satyaji2023 Жыл бұрын
Environment geography ki master video .
@curlyworld4365 Жыл бұрын
Yess sir
@sheetalmali80526 ай бұрын
Thanks sir
@someshsomiya Жыл бұрын
Very usefulness session thanks sir..
@iashimanshisaini8893 Жыл бұрын
Sir kansky ne jo pi or eta index diye vo 1963 me diye the 1936 kyoki aapne padhate time do bar 1936 bataya h or ppt notes me 1963 likha hua h
@susmitadas1855 Жыл бұрын
Thank you sir🙂 one of the Important class.
@Sahukrishana Жыл бұрын
Super class sir
@priyankadeb86566 ай бұрын
Revised again , Thank you so much Sir😊
@Alleducationalpath_016 ай бұрын
Central matrix me aapko clear hai kya C sabse kam connectivity hai
@Taneeasharma6 ай бұрын
Phenomenally explained topic Sir, keep up the good work 👏
@Alleducationalpath_016 ай бұрын
Please tell me how C is lowest connectivity in central matrix Mujhe.lgta hai C is maximum connectivity center
@Alleducationalpath_016 ай бұрын
Central matrix me C ki connectivity sabse jada hogi aur E ki sabse kam Aapne jo bataya h mujhe clear nhi h kyu ki C sabse jada root se connect ho rha
@poojamoyal6194 ай бұрын
Usme total nodes dekhne h ki konsa node kitne nodes se connect h dusre node tk jaane k liya
@Alleducationalpath_016 ай бұрын
Dekhne se direct lg rha C ka connectivity jada hai E ka sabse kam phir kaise ye huwa???
@nitinSingh-cl2ch4 ай бұрын
Right, Because Koning number is anti proportional to connectivity.Since the Koning number of C is lowest among them so it has highest connectivity.
@jmd6437 Жыл бұрын
Sir I m the biggest fan of u
@shyampermimandeep Жыл бұрын
Sir Aaj class kyu nhi hue
@pujabishnoi56347 ай бұрын
Graph is set of vertes(node)and link(edge) . Edge (link) link between two nodes Loop connect between two unit Diameter shortest possible path. Connectivity wnd measurements: Degree of completness the link between nodes.1978 Robinson and Bamford Kansaky 1963 Alpha beta ghama cyclonic no.connectivity measurement ke liye.
@manojrchm7925 Жыл бұрын
Models of transport development
@amreenadeeba4782Ай бұрын
thank you sir for such a comprehensive lecture on the topic!