Difference between Walk, Trail, Path, Circuit and Cycle with most suitable example | Graph Theory

  Рет қаралды 329,341

Gate Smashers

Gate Smashers

Күн бұрын

Пікірлер: 425
@himanshumaurya2496
@himanshumaurya2496 Жыл бұрын
Option C is correct i.e. 2 and 3 ( 2. A TRAIL is always a walk and 3. A PATH is always a walk. )
@simpleperson404
@simpleperson404 10 ай бұрын
because WALK is superset so other two options eliminated ez
@shubhpatkar862
@shubhpatkar862 8 ай бұрын
yes exactly, option C is correct
@sp8976
@sp8976 7 ай бұрын
@@shubhpatkar862 no because in walk verteces and edges repetation are allowed
@amarnathprajapati2543
@amarnathprajapati2543 3 жыл бұрын
Q1- c Q2-d Thanks Sir, Your videos are very helpful for me.
@sahilkadecha9831
@sahilkadecha9831 3 жыл бұрын
correct nath
@AbdulHadiEServices
@AbdulHadiEServices 3 жыл бұрын
Amazing!!!! you are forcing me to press Like.
@imranabbasi9535
@imranabbasi9535 3 жыл бұрын
Never feel forced to do anything
@iramkhan4798
@iramkhan4798 2 жыл бұрын
@@imranabbasi9535 hmm😁
@Tech_From_ground
@Tech_From_ground 6 ай бұрын
I try to learn many of my subjects from KZbin but i'm depressed because i'm a below average student who's not able to understand so quickly but Varun Singla Sir is some next level power to teach everything in such a manner that stupid like me was understand so quickly.... ❤❤❤❤☺☺☺☺
@Mad_Reaper
@Mad_Reaper Жыл бұрын
So 1(C) & 2(D)?? Also aweomse video, ik its been 4 years but its still helping so many students. Keep up the great work sir!🔥
@ansmehmood9415
@ansmehmood9415 8 ай бұрын
i think 2 (A) bcz edges and vertex are available
@garimasrivastava2952
@garimasrivastava2952 Жыл бұрын
I am so grateful that you've covered all my next sem subjects! You're an amazing teacher
@insatgaming2932
@insatgaming2932 Жыл бұрын
BCA ?
@nabilaali8548
@nabilaali8548 Жыл бұрын
Exactly
@sahilprasantachoudhury911
@sahilprasantachoudhury911 4 жыл бұрын
Self referential note: Walk : Vertex✓, Edge ✓ Trail : Vertex✓, Edge × ; Closed Trail aka Circuit Path : Vertex × (Except 1st and last Vertex) ; Closed Path aka Cycle
@basitrahman514
@basitrahman514 4 жыл бұрын
What about repeating the edges in Path ?
@ayyappapalani288
@ayyappapalani288 3 жыл бұрын
@@basitrahman514 edges shouldn't be repeated in path
@deenkibatain754
@deenkibatain754 3 жыл бұрын
Vertices should not repeat
@cartoons__for__kids_Hindi
@cartoons__for__kids_Hindi 2 жыл бұрын
@@basitrahman514 when you can't repeat a vertex, then you naturally cannot repeat a edge, if you try to repeat a edge, a vertex will get repeated
@basitrahman514
@basitrahman514 2 жыл бұрын
@@cartoons__for__kids_Hindi thanks..got it
@ruchika_7
@ruchika_7 3 жыл бұрын
Cleared all my doubts..thankyou sir
@abdulqudoos6824
@abdulqudoos6824 3 жыл бұрын
asey desi zubaan main lecture sunnay ka mzah he kuch aur hai qasam say thankyou sir
@ankan.neutrinos
@ankan.neutrinos Жыл бұрын
Thanks sir for the guidence for syllebus and teaching so accurately from basic so that every student can learn ♥️
@hakimaaqlim1036
@hakimaaqlim1036 4 жыл бұрын
Your teaching method is the best ❤️
@parvking5944
@parvking5944 Жыл бұрын
Sir Hats Off 🛐🛐🛐 the way he explains makes its so easy to understand concept ekdum clear
@aarohidua
@aarohidua 6 ай бұрын
The topics which took hours for our uni lecturer to explain were explained so easily by you in the span of less than 10 mins each....forever grateful for this platform which helped me reach you sir
@Allgaming-zw6et
@Allgaming-zw6et 5 ай бұрын
Hii
@mr_roadhunter6603
@mr_roadhunter6603 4 жыл бұрын
Thank you sir you are the best sir 🙏🙏🙏 thanks for always making us motivated and keep our studies up-to-date.
@ShivamGupta-by7vg
@ShivamGupta-by7vg 2 жыл бұрын
Sir aapki samjhane ki technique bahut achi ha ekdm se concepts clear jo haate ha
@alayamaryim
@alayamaryim 2 жыл бұрын
Q1. C Q2. D Nice delivery👍
@akhileshchaudhary8821
@akhileshchaudhary8821 2 жыл бұрын
A 3 year old video means a lot to me!!
@Natural.168
@Natural.168 Жыл бұрын
Sir not only graph theory ,OS, compilers construction,DSA,DAA, software engineering, DBMS, TOC ,DISCRETE MATHS ,I learned from youu . i Have no word for thanks. And my wish is to meet with you face by face sir. i love you sir. shafqat hussain from Pakistan THANKYOUSOOMUCH sir @
@JAISVEEN-spdn8
@JAISVEEN-spdn8 Жыл бұрын
Tq sir for uploading this amazing video 🎉❤🎉🎉
@divyrajverma8286
@divyrajverma8286 10 ай бұрын
हर हर महादेव जय माँ भवानी जय श्रीराम जय माँ सीता जय हनुमानजी हर हर महादेव जय माँ भवानी जय श्रीराम जय माँ सीता जय हनुमानजी 🙏🙏🙏🙏🙏🙏❤❤❤❤❤❤🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩
@giteshkapoor5132
@giteshkapoor5132 16 күн бұрын
Q1 - c Q2 - d Thank you sir for fantastic explanation❤😇
@Atifrahman544
@Atifrahman544 Жыл бұрын
Sir you are multi talented.I will meet you one day sir.May God bless you
@jinip451
@jinip451 Жыл бұрын
Sir is the answer 1.c and 2.d
@TrishalMishra
@TrishalMishra 10 ай бұрын
I found the best 👌🏻 ❤😊teacher thank u sir 🙏🏻 😊
@Naju283
@Naju283 Ай бұрын
Q1=C ,Q2=D...... Thanks so much 🥰.....
@ankandebnath1056
@ankandebnath1056 11 ай бұрын
Q1) (C) 2 and 3 2) A trail is a walk 3) A path is walk Q2) (D) a->f->b->g->e->b->a is a circuit but not path As b vertex is repeated.
@fasana1110
@fasana1110 5 ай бұрын
2 (a) is not correct?
@nomanriaz8134BhattiNotes
@nomanriaz8134BhattiNotes 2 жыл бұрын
Thanks sir,,,, am understand very easily and It's Answers are Q.1: c) Q.2: d)
@debarkiaravind5663
@debarkiaravind5663 11 ай бұрын
Excellent!!! Sir thank you for this wonderful lecture
@madhurjyadeka5569
@madhurjyadeka5569 4 жыл бұрын
Q1 option c.. by using set theory Trails and paths will always be inside the Walk set
@abhishekgaurav9908
@abhishekgaurav9908 3 жыл бұрын
Yeah its correct.
@bunny13173
@bunny13173 Жыл бұрын
Thank you so much sir for uploading this amazing video 🎉
@seemapp3951
@seemapp3951 2 жыл бұрын
1-2 and 3 right 2-1--walk but not trail 2--trail and also close path 3--circuit and cycle both 4--its path but not circuit
@chiki6704
@chiki6704 4 ай бұрын
You teach really well sir Respect++ and your Punjabi accent is sweet to hear 😁
@anupamakumari2695
@anupamakumari2695 3 жыл бұрын
Simple and best explanation ❤️❤️❤️❤️
@ramanrajagopalan3215
@ramanrajagopalan3215 Жыл бұрын
Hi this is my observation correct me if am wrong Q1: Walk is a bigger entity and trail and path are sub entities under walk. So option1 Walk is always a trail Yes!! , option2 and 3 NO!!. At last option4 Walk is always a path. So we can conclude by saying that B is the right answer.
@RUSHIPANSARE
@RUSHIPANSARE 8 ай бұрын
badiya sirrrrrrrrrrrrrrrrr
@shaifali3105
@shaifali3105 3 жыл бұрын
Bohot ache explain kar rahe ho sir.... Awesome
@shivkumartaneja
@shivkumartaneja 4 ай бұрын
Very nice explanation 👌
@aerbhamukesh7273
@aerbhamukesh7273 3 жыл бұрын
Bahot badiya ... Easy explanation... Thank you... Keep it up...
@BWU_BCA__Payel
@BWU_BCA__Payel 2 жыл бұрын
thanks sir very helful video for the ugc students
@jasdeepsingh7553
@jasdeepsingh7553 5 жыл бұрын
Option c of 1st question and d of 2nd question
@SanglapKundu
@SanglapKundu 2 жыл бұрын
1.c 2. D Thank u sir 🙂
@memeworld91919
@memeworld91919 2 жыл бұрын
Thank u guru ji
@hassaninbajwa7162
@hassaninbajwa7162 Жыл бұрын
Thank you so much sir ❤️ I appreciate your efforts
@prachiyargatti016
@prachiyargatti016 10 ай бұрын
You are so amazing sir
@ramanrajagopalan3215
@ramanrajagopalan3215 Жыл бұрын
Q2: option D) is right as the vertex b is repeated twice. Correct me if i am wrong
@adityamishra8296
@adityamishra8296 9 ай бұрын
thanks man for this quick explanation keep up the good work😇😇😇😇 you are a big help
@kavithapriyacj4868
@kavithapriyacj4868 2 жыл бұрын
As always Guru the Time and Live Saver ...😍🤗😘
@musicalindia5734
@musicalindia5734 Жыл бұрын
Life**
@rishabrajsoni8347
@rishabrajsoni8347 7 ай бұрын
Sir,can you make video related to path degree sequence and distance degree sequence
@mohsinmudassir8295
@mohsinmudassir8295 15 күн бұрын
Dear bro , you are gem
@rounaknag68
@rounaknag68 Жыл бұрын
For Q2 option b shold be the answer as its not forming closed path also edges are not repeating so it should be trail
@Anirudh_Srinivasan
@Anirudh_Srinivasan 2 жыл бұрын
C) 2 and 3 is the right answer.
@debjitroxx
@debjitroxx 11 ай бұрын
Q2 = option d(true) b vertex is repeated so path is not possible but circuit is
@88_avinashprakashsherla82
@88_avinashprakashsherla82 6 ай бұрын
Thank you sir ji❤
@bibek6556
@bibek6556 2 жыл бұрын
Thank you very much sir I have confused between them now it is clear for me
@muhammadi8141
@muhammadi8141 2 жыл бұрын
Q1- c) Q2- d) is a circuit but not path because vertex 'b' is repeated .
@yashthakkar4549
@yashthakkar4549 Жыл бұрын
a to f to b and b to a are different edges?
@SatvikaVyas
@SatvikaVyas Жыл бұрын
The edge between b and a is repeating. Hence it is not a trail => not circuit
@VivekKumar-jn5bb
@VivekKumar-jn5bb Жыл бұрын
​@@SatvikaVyas ma'am kaha edges repeating ho rahi hai 🤔
@CfffAszedc
@CfffAszedc Жыл бұрын
​@@SatvikaVyasThere is a parallel edge between a and b hence the edge is not repeating
@akhilsinghsanoria1258
@akhilsinghsanoria1258 5 жыл бұрын
Thank you so much sir,I have learned so much from this channel
@Nebula096
@Nebula096 10 ай бұрын
so what are you doing now?
@ssumida4531
@ssumida4531 2 жыл бұрын
sir, your explanations are tooooo good..its very easy to understand by ur videos..
@mannbajpai4713
@mannbajpai4713 2 жыл бұрын
1-c; 2-d THANK YOU SIR
@abdullahanwar8064
@abdullahanwar8064 5 жыл бұрын
yours way of teaching was awesome really
@shivarajput1043
@shivarajput1043 4 жыл бұрын
Thanku Sir ji
@ShahzainSana
@ShahzainSana 7 ай бұрын
option B is correct i think q k walk mn dono a jaty hain
@sajansekhu8785
@sajansekhu8785 5 жыл бұрын
thnkss alott ji...God bless u forever...
@NeerajSharma-ug3ei
@NeerajSharma-ug3ei 2 жыл бұрын
good lectures . que.1 c que 2 d.
@hforheadshot6427
@hforheadshot6427 Жыл бұрын
Option (C) 2 and 3
@bhaveshbachhav6981
@bhaveshbachhav6981 3 жыл бұрын
Thanks sir, nice teaching all concept clear👍🏻.. 😇
@Allinone-fg1zt
@Allinone-fg1zt 2 жыл бұрын
wonderful speech bro thnx
@ayesha7367
@ayesha7367 Жыл бұрын
Sir really your method is amazing 💯
@kunalsingh5794
@kunalsingh5794 5 жыл бұрын
Sir your videos are so helpful...👍👍👍👍
@sabbu3791
@sabbu3791 5 жыл бұрын
Flow of teaching was amazing sir!
@LaxmanKumar-zu5vv
@LaxmanKumar-zu5vv 11 ай бұрын
Q1 - c Q2- d. Because he ( B is repeated )
@rutujamohite4434
@rutujamohite4434 2 жыл бұрын
Amazing 👍
@DEVILGAMING-kh1ue
@DEVILGAMING-kh1ue Жыл бұрын
2 and 3 are correct
@good114
@good114 3 жыл бұрын
Thank you Sir 🙏🙏🙏🙏❤️❤️❤️
@qurrat-ul-ain8331
@qurrat-ul-ain8331 3 жыл бұрын
Nice explanation
@craftmedia3448
@craftmedia3448 Жыл бұрын
9:14 Answer of the question is C
@KainatAnwar-e6v
@KainatAnwar-e6v 10 күн бұрын
Nice❤
@shriyansh_agarwal
@shriyansh_agarwal 4 жыл бұрын
Sir pls confirm the answers Question 1- C (2 and 3) Question 2- D (circuit but not path👣)
@cartoons__for__kids_Hindi
@cartoons__for__kids_Hindi 2 жыл бұрын
Right 👍
@geetanjalibiswal7233
@geetanjalibiswal7233 2 жыл бұрын
Correct ans👍
@jayminahir
@jayminahir 2 жыл бұрын
How i go b to a directly
@vishalgarg3177
@vishalgarg3177 4 жыл бұрын
1. C 2. B
@Sonusonu-uc7is
@Sonusonu-uc7is 11 ай бұрын
Q1 C)2 and 3
@psychris_
@psychris_ 8 ай бұрын
Love you sir. Exam mein apne bacha liya ❤❤
@117_pranavgatade6
@117_pranavgatade6 9 ай бұрын
Q1- c Q2-d is it right?
@atrikashow8118
@atrikashow8118 2 жыл бұрын
homework Answer--------------- < Q1 > ans -- c (2 & 3) < Q2 > ans -- a (is a walk and also a trail).
@Tech_From_ground
@Tech_From_ground 6 ай бұрын
Q1: (c) Q2: (A) please check whether i'm Right or wrong.
@mohitkumarmahata7525
@mohitkumarmahata7525 4 жыл бұрын
'C 2&3
@SanskarMishra-o2q
@SanskarMishra-o2q Жыл бұрын
Very nice sir
@sp8976
@sp8976 7 ай бұрын
q1) option d is correct and q2) option d is correct
@theshow3734
@theshow3734 7 ай бұрын
In question 2 c is also correct
@arslanhafeez2312
@arslanhafeez2312 5 жыл бұрын
Superb explanation
@debashisbera
@debashisbera 8 ай бұрын
1) -> option C is the ans 2) -> option D is the ans
@geethakc3562
@geethakc3562 Жыл бұрын
Ans is c) Trail and Path are always a walk. But walk can't be Trail and Path since V and E are repeated.
@PratimaYadav-bg3ug
@PratimaYadav-bg3ug 4 жыл бұрын
Thanku sir🙏
@syedghulamhassansherazi8028
@syedghulamhassansherazi8028 2 ай бұрын
Correct Answer: © 2 and 3 Here’s why: Statement 2: A trail is always a walk. This is true because a trail is a type of walk where no edge is repeated. Statement 3: A path is always a walk. This is true because a path is a type of walk where no vertex is repeated.
@deshatgaming2448
@deshatgaming2448 3 жыл бұрын
Sir plz make video on isomorphism
@ET-057
@ET-057 11 ай бұрын
hy .walk consist only vertex or egde....?
@KrishanaChauhan-tr7cr
@KrishanaChauhan-tr7cr Жыл бұрын
option C is right
@misbahfaryal
@misbahfaryal 3 жыл бұрын
Your learning method iss osm
@dn9678
@dn9678 2 жыл бұрын
Nice sir .good...
@gyanjyotikalita7254
@gyanjyotikalita7254 5 жыл бұрын
In some book it is given that edges cannot be repeated in walk
@techvids9824
@techvids9824 5 жыл бұрын
Yes same here.kuch main likha hua k edges and vertices repeated but kisi m ha k edges DNT repeat.ab kia smjhen hum
@vimalsheoran8040
@vimalsheoran8040 4 жыл бұрын
Ab toh Euler ko hi bulana padega
@Ali-en2on
@Ali-en2on 4 жыл бұрын
Yes....write in some books.that the edges is no repeat in walk.
@syedammarali108
@syedammarali108 4 жыл бұрын
In my case, edges, and vertices can be repeated. I also came here to cross-check. I don't know which one is right.
@RaviSingh-yf6jd
@RaviSingh-yf6jd 4 жыл бұрын
Edge can not be repeated
@CommonStudentActivity
@CommonStudentActivity Жыл бұрын
Option c is correct?
@pritpalAimers
@pritpalAimers 5 жыл бұрын
sir plz ..system software ki series shuru kroo..
Types of Simple Graph | Special Graphs
12:59
Gate Smashers
Рет қаралды 186 М.
Увеличили моцареллу для @Lorenzo.bagnati
00:48
Кушать Хочу
Рет қаралды 7 МЛН
СОБАКА ВЕРНУЛА ТАБАЛАПКИ😱#shorts
00:25
INNA SERG
Рет қаралды 3,9 МЛН
Каха и лужа  #непосредственнокаха
00:15
Define Walk , Trail , Circuit , Path and Cycle in a GRAPH | Graph Theory #9
9:13
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 171 М.
Handshaking Theorem in Graph Theory | Imp for UGC NET and GATE
7:43
Gate Smashers
Рет қаралды 324 М.
Isomorphism in Graph Theory in Hindi
8:35
Gate Smashers
Рет қаралды 562 М.
Hamiltonian Graph with examples | Hamiltonian Path & Circuit
8:38
Gate Smashers
Рет қаралды 468 М.
Connected component of Graph | Cut Edge | Cut Vertex | bridge | Graph theory
12:16
Walk Path Trail Tour Cycle | Graph Theory | Discrete Mathematics
12:13
Sandeep Kumar Gour
Рет қаралды 41 М.
Увеличили моцареллу для @Lorenzo.bagnati
00:48
Кушать Хочу
Рет қаралды 7 МЛН