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

Поділитися
Вставка
  • Опубліковано 19 вер 2024
  • #graphTheory#trail#circuit#cycle#intel
    👉Subscribe to our new channel: / @varunainashots
    1. Walk - A walk is a sequence of vertices and edges of a graph i.e. if we traverse a graph then we get a walk.
    2. Trail - Trail is an open walk in which no edge is repeated.
    3. Path - It is a trail in which neither vertices nor edges are repeated i.e. if we traverse a graph such that we do not repeat a vertex and nor we repeat an edge. As path is also a trail, thus it is also an open walk.
    4. Circuit - Traversing a graph such that not an edge is repeated but vertex can be repeated and it is closed also i.e. it is a closed trail.
    5. Cycle - Traversing a graph such that we do not repeat a vertex nor we repeat a edge but the starting and ending vertex must be same i.e. we can repeat starting and ending vertex only then we get a cycle.
    ►Graph Theory (Complete Playlist):
    • Graph Theory
    Other subject-wise playlist Links:
    --------------------------------------------------------------------------------------------------------------------------------------
    ►Design and Analysis of algorithms (DAA):
    • Design and Analysis of...
    ►Database Management System:
    • DBMS (Database Managem...
    ► Theory of Computation
    • TOC(Theory of Computat...
    ►Artificial Intelligence:
    • Artificial Intelligenc...
    ►Computer Networks (Complete Playlist):
    • Computer Networks (Com...
    ►Operating System:
    • Operating System (Comp...
    ►Structured Query Language (SQL):
    • Structured Query Langu...
    ►Discrete Mathematics:
    • Discrete Mathematics
    ►Compiler Design:
    • Compiler Design (Compl...
    ►Number System:
    • Number system
    ►Cloud Computing & BIG Data:
    • Cloud Computing & BIG ...
    ►Software Engineering:
    • Software Engineering
    ►Data Structure:
    • Data Structure
    ►Computer Architecture :
    • Computer Organization ...
    ►Programming in C:
    • C Programming
    ►Digital Logic:
    • Digital Logic (Complet...
    ---------------------------------------------------------------------------------------------------------------------------------------
    Our social media Links:
    ► Subscribe to us on UA-cam: / gatesmashers
    ►Subscribe to our new channel: / @varunainashots
    ► Like our page on Facebook: / gatesmashers
    ► Follow us on Instagram: / gate.smashers
    ► Follow us on Instagram: / varunainashots
    ► Follow us on Telegram: t.me/gatesmash...
    ► Follow us on Threads: www.threads.ne...
    --------------------------------------------------------------------------------------------------------------------------------------
    ►For Any Query, Suggestion or notes contribution:
    Email us at: gatesmashers2018@gmail.com

КОМЕНТАРІ • 416

  • @himanshumaurya2496
    @himanshumaurya2496 Рік тому +59

    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 8 місяців тому +2

      because WALK is superset so other two options eliminated ez

    • @shubhpatkar862
      @shubhpatkar862 6 місяців тому

      yes exactly, option C is correct

    • @sp8976
      @sp8976 5 місяців тому

      @@shubhpatkar862 no because in walk verteces and edges repetation are allowed

  • @amarnathprajapati2543
    @amarnathprajapati2543 3 роки тому +56

    Q1- c
    Q2-d
    Thanks Sir, Your videos are very helpful for me.

  • @Mad_Reaper
    @Mad_Reaper 10 місяців тому +15

    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 6 місяців тому

      i think 2 (A) bcz edges and vertex are available

  • @sahilprasantachoudhury911
    @sahilprasantachoudhury911 3 роки тому +257

    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 3 роки тому +3

      What about repeating the edges in Path ?

    • @ayyappapalani288
      @ayyappapalani288 3 роки тому +2

      @@basitrahman514 edges shouldn't be repeated in path

    • @deenkibatain754
      @deenkibatain754 3 роки тому +3

      Vertices should not repeat

    • @cartoons__for__kids_Hindi
      @cartoons__for__kids_Hindi 2 роки тому +18

      @@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 роки тому +1

      @@cartoons__for__kids_Hindi thanks..got it

  • @AbdulHadiEServices
    @AbdulHadiEServices 3 роки тому +108

    Amazing!!!! you are forcing me to press Like.

  • @garimasrivastava2952
    @garimasrivastava2952 Рік тому +17

    I am so grateful that you've covered all my next sem subjects!
    You're an amazing teacher

  • @ankandebnath1056
    @ankandebnath1056 9 місяців тому +9

    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 3 місяці тому

      2 (a) is not correct?

  • @SabyasachiIndia
    @SabyasachiIndia 4 місяці тому +2

    I try to learn many of my subjects from UA-cam 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.... ❤❤❤❤☺☺☺☺

  • @MeowR7
    @MeowR7 3 роки тому +8

    Cleared all my doubts..thankyou sir

  • @hakimaaqlim1036
    @hakimaaqlim1036 4 роки тому +6

    Your teaching method is the best ❤️

  • @ankan.neutrinos
    @ankan.neutrinos Рік тому +6

    Thanks sir for the guidence for syllebus and teaching so accurately from basic so that every student can learn ♥️

  • @mr_roadhunter6603
    @mr_roadhunter6603 3 роки тому +9

    Thank you sir you are the best sir 🙏🙏🙏 thanks for always making us motivated and keep our studies up-to-date.

  • @abdulqudoos6824
    @abdulqudoos6824 3 роки тому +1

    asey desi zubaan main lecture sunnay ka mzah he kuch aur hai qasam say thankyou sir

  • @alayamaryim
    @alayamaryim Рік тому +2

    Q1. C
    Q2. D
    Nice delivery👍

  • @anupamakumari2695
    @anupamakumari2695 3 роки тому +6

    Simple and best explanation ❤️❤️❤️❤️

  • @aarohidua
    @aarohidua 4 місяці тому

    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

  • @akhileshchaudhary8821
    @akhileshchaudhary8821 2 роки тому +8

    A 3 year old video means a lot to me!!

  • @JAISVEEN-spdn8
    @JAISVEEN-spdn8 Рік тому +2

    Tq sir for uploading this amazing video 🎉❤🎉🎉

  • @ShivamGupta-by7vg
    @ShivamGupta-by7vg Рік тому

    Sir aapki samjhane ki technique bahut achi ha ekdm se concepts clear jo haate ha

  • @parvking5944
    @parvking5944 Рік тому +2

    Sir Hats Off 🛐🛐🛐 the way he explains makes its so easy to understand concept ekdum clear

  • @RUSHIPANSARE
    @RUSHIPANSARE 6 місяців тому +1

    badiya sirrrrrrrrrrrrrrrrr

  • @divyrajverma8286
    @divyrajverma8286 9 місяців тому +1

    हर हर महादेव जय माँ भवानी जय श्रीराम जय माँ सीता जय हनुमानजी हर हर महादेव जय माँ भवानी जय श्रीराम जय माँ सीता जय हनुमानजी 🙏🙏🙏🙏🙏🙏❤❤❤❤❤❤🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩

  • @shivkumartaneja
    @shivkumartaneja 2 місяці тому

    Very nice explanation 👌

  • @jinip451
    @jinip451 Рік тому +3

    Sir is the answer 1.c and 2.d

  • @memeworld91919
    @memeworld91919 2 роки тому +1

    Thank u guru ji

  • @madhurjyadeka5569
    @madhurjyadeka5569 3 роки тому +10

    Q1 option c.. by using set theory Trails and paths will always be inside the Walk set

  • @88_avinashprakashsherla82
    @88_avinashprakashsherla82 4 місяці тому

    Thank you sir ji❤

  • @chiki6704
    @chiki6704 2 місяці тому

    You teach really well sir Respect++
    and your Punjabi accent is sweet to hear 😁

  • @ramanrajagopalan3215
    @ramanrajagopalan3215 Рік тому +1

    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.

  • @aerbhamukesh7273
    @aerbhamukesh7273 3 роки тому +1

    Bahot badiya ...
    Easy explanation...
    Thank you...
    Keep it up...

  • @Anirudh_Srinivasan
    @Anirudh_Srinivasan 2 роки тому +1

    C) 2 and 3 is the right answer.

  • @seemapp3951
    @seemapp3951 2 роки тому +8

    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

  • @SanglapKundu
    @SanglapKundu 2 роки тому +2

    1.c 2. D
    Thank u sir 🙂

  • @jasdeepsingh7553
    @jasdeepsingh7553 5 років тому +6

    Option c of 1st question and d of 2nd question

  • @shaifali3105
    @shaifali3105 3 роки тому +1

    Bohot ache explain kar rahe ho sir.... Awesome

  • @rutujamohite4434
    @rutujamohite4434 2 роки тому +1

    Amazing 👍

  • @muhammadi8141
    @muhammadi8141 2 роки тому +46

    Q1- c)
    Q2- d) is a circuit but not path because vertex 'b' is repeated .

    • @yashthakkar4549
      @yashthakkar4549 Рік тому +2

      a to f to b and b to a are different edges?

    • @SatvikaVyas
      @SatvikaVyas Рік тому +1

      The edge between b and a is repeating. Hence it is not a trail => not circuit

    • @VivekKumar-jn5bb
      @VivekKumar-jn5bb Рік тому +1

      ​@@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

  • @hassaninbajwa7162
    @hassaninbajwa7162 Рік тому +3

    Thank you so much sir ❤️
    I appreciate your efforts

  • @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 @

  • @akhilsinghsanoria1258
    @akhilsinghsanoria1258 5 років тому +4

    Thank you so much sir,I have learned so much from this channel

    • @Nebula096
      @Nebula096 8 місяців тому

      so what are you doing now?

  • @nomanriaz8134BhattiNotes
    @nomanriaz8134BhattiNotes 2 роки тому

    Thanks sir,,,, am understand very easily and
    It's Answers are
    Q.1: c)
    Q.2: d)

  • @shivarajput1043
    @shivarajput1043 3 роки тому +1

    Thanku Sir ji

  • @mohitkumarmahata7525
    @mohitkumarmahata7525 4 роки тому +1

    'C 2&3

  • @sabbu3791
    @sabbu3791 4 роки тому +4

    Flow of teaching was amazing sir!

  • @kunalsingh5794
    @kunalsingh5794 5 років тому +2

    Sir your videos are so helpful...👍👍👍👍

  • @bunny13173
    @bunny13173 Рік тому +1

    Thank you so much sir for uploading this amazing video 🎉

  • @Atifrahman544
    @Atifrahman544 10 місяців тому

    Sir you are multi talented.I will meet you one day sir.May God bless you

  • @kavithapriyacj4868
    @kavithapriyacj4868 Рік тому +2

    As always Guru the Time and Live Saver ...😍🤗😘

  • @TrishalMishra
    @TrishalMishra 8 місяців тому

    I found the best 👌🏻 ❤😊teacher thank u sir 🙏🏻 😊

  • @debarkiaravind5663
    @debarkiaravind5663 9 місяців тому

    Excellent!!! Sir thank you for this wonderful lecture

  • @BWU_BCA__Payel
    @BWU_BCA__Payel 2 роки тому

    thanks sir
    very helful video for the ugc students

  • @prachiyargatti016
    @prachiyargatti016 8 місяців тому

    You are so amazing sir

  • @bibek6556
    @bibek6556 2 роки тому +1

    Thank you very much sir
    I have confused between them now it is clear for me

  • @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

  • @arslanhafeez2312
    @arslanhafeez2312 5 років тому +2

    Superb explanation

  • @bhaveshbachhav6981
    @bhaveshbachhav6981 2 роки тому +1

    Thanks sir, nice teaching all concept clear👍🏻.. 😇

  • @syedghulamhassansherazi8028
    @syedghulamhassansherazi8028 12 днів тому

    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.

  • @vishalgarg3177
    @vishalgarg3177 4 роки тому +1

    1. C
    2. B

  • @PratimaYadav-bg3ug
    @PratimaYadav-bg3ug 3 роки тому +1

    Thanku sir🙏

  • @sajansekhu8785
    @sajansekhu8785 4 роки тому +1

    thnkss alott ji...God bless u forever...

  • @NeerajSharma-ug3ei
    @NeerajSharma-ug3ei 2 роки тому

    good lectures .
    que.1 c
    que 2 d.

  • @qurrat-ul-ain8331
    @qurrat-ul-ain8331 3 роки тому +1

    Nice explanation

  • @Sonusonu-uc7is
    @Sonusonu-uc7is 9 місяців тому

    Q1 C)2 and 3

  • @abdullahanwar8064
    @abdullahanwar8064 4 роки тому

    yours way of teaching was awesome really

  • @good114
    @good114 2 роки тому +1

    Thank you Sir 🙏🙏🙏🙏❤️❤️❤️

  • @user-zj3rg3jl3x
    @user-zj3rg3jl3x Рік тому

    Very nice sir

  • @craftmedia3448
    @craftmedia3448 Рік тому +1

    9:14
    Answer of the question is
    C

  • @rishabrajsoni8347
    @rishabrajsoni8347 5 місяців тому

    Sir,can you make video related to path degree sequence and distance degree sequence

  • @ramanrajagopalan3215
    @ramanrajagopalan3215 Рік тому

    Q2: option D) is right as the vertex b is repeated twice. Correct me if i am wrong

  • @misbahfaryal
    @misbahfaryal 3 роки тому

    Your learning method iss osm

  • @atrikashow8118
    @atrikashow8118 2 роки тому +1

    homework Answer---------------
    < Q1 > ans -- c (2 & 3)
    < Q2 > ans -- a (is a walk and also a trail).

  • @ayesha7367
    @ayesha7367 Рік тому

    Sir really your method is amazing 💯

  • @DEVILGAMING-kh1ue
    @DEVILGAMING-kh1ue Рік тому +1

    2 and 3 are correct

  • @raghunandankrishnan6404
    @raghunandankrishnan6404 2 роки тому

    Bale bale shabha shabha understood sir

  • @hinathanki3005
    @hinathanki3005 2 роки тому

    Superb video...very useful

  • @geethakc3562
    @geethakc3562 Рік тому +1

    Ans is c)
    Trail and Path are always a walk.
    But walk can't be Trail and Path since V and E are repeated.

  • @dn9678
    @dn9678 2 роки тому

    Nice sir .good...

  • @adityamishra8296
    @adityamishra8296 7 місяців тому

    thanks man for this quick explanation keep up the good work😇😇😇😇 you are a big help

  • @ssumida4531
    @ssumida4531 2 роки тому

    sir, your explanations are tooooo good..its very easy to understand by ur videos..

  • @shriyansh_agarwal
    @shriyansh_agarwal 3 роки тому +16

    Sir pls confirm the answers
    Question 1- C (2 and 3)
    Question 2- D (circuit but not path👣)

  • @rounak3239
    @rounak3239 5 років тому

    Gurujee shandhar jabardast zindabad

  • @anjalihagargi3707
    @anjalihagargi3707 5 років тому +5

    Sir net schedule k hisab se video start kijiye sir please

  • @devang100
    @devang100 Рік тому

    thank you sir

  • @Sudeshsorout
    @Sudeshsorout 5 років тому +1

    Very good sir g

  • @mannbajpai4713
    @mannbajpai4713 2 роки тому +1

    1-c; 2-d THANK YOU SIR

  • @theshow3734
    @theshow3734 5 місяців тому

    In question 2 c is also correct

  • @hforheadshot6427
    @hforheadshot6427 10 місяців тому +1

    Option (C) 2 and 3

  • @LaxmanKumar-zu5vv
    @LaxmanKumar-zu5vv 9 місяців тому

    Q1 - c
    Q2- d. Because he ( B is repeated )

  • @Allinone-fg1zt
    @Allinone-fg1zt 2 роки тому

    wonderful speech bro thnx

  • @debjitroxx
    @debjitroxx 9 місяців тому

    Q2 = option d(true)
    b vertex is repeated so path is not possible but circuit is

  • @preethamm.n1161
    @preethamm.n1161 5 років тому +1

    Awesome explanation...!

  • @ET-057
    @ET-057 9 місяців тому

    hy .walk consist only vertex or egde....?

  • @pujasumanthytripathy5366
    @pujasumanthytripathy5366 4 роки тому

    Thank you Sir🙏🙏🙏

  • @deepikayadav9556
    @deepikayadav9556 5 років тому +2

    Sir plzz continue co...

  • @anshuman3652
    @anshuman3652 2 роки тому +1

    Thanks sir💞

  • @vanshikashrivastav4962
    @vanshikashrivastav4962 4 роки тому +1

    Thank you very much Sir

  • @ਕਿਰਨਦੀਪਕੌਰ-ਠ8ਙ

    Thanks sir

  • @debashisbera
    @debashisbera 6 місяців тому

    1) -> option C is the ans
    2) -> option D is the ans

  • @ginianto7515
    @ginianto7515 4 роки тому

    Thank u sir😊

  • @psychris_
    @psychris_ 6 місяців тому

    Love you sir. Exam mein apne bacha liya ❤❤