Hamiltonian Graph || Dirac's Theorem || Ore's Theorem || GATECSE || Graph Theory

Поділитися
Вставка
  • Опубліковано 18 гру 2024

КОМЕНТАРІ • 29

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

    This video is so good . The way he describes every thing is so easy to understand. He deserves more views and love

  • @tootechnical0504
    @tootechnical0504 10 місяців тому +2

    very useful videos sir 👍

  • @sting8gaming963
    @sting8gaming963 11 місяців тому +1

    Thanks sir for giving exactly point of ore and dirac theorem

  • @Sandeep-tv1px
    @Sandeep-tv1px Рік тому +2

    Very Good Explanation! You made the concept clear :)

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

    Excellent sir...

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

    Excellent teaching👍

  • @bhattazhar8406
    @bhattazhar8406 2 дні тому

    Sir g luv uh .....whatt ab explanation ❤❤❤

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

    Great teacher.

  • @NancyChoudhary-uo2ic
    @NancyChoudhary-uo2ic Рік тому +1

    Sir jb dirac thoerm thi to ore theorem se kya hi fayda hua.... Different hua kuchh?

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

    can we calculate the total degree of vertext like deg(total) >= n/2 is it correct?

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

    Sir the first example is a Hamiltonian graph sir ,if start form the below vertex

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

      no it is not because you cant form a cycle on that graph when it has a degree 1 so you cant return to the same vertex.

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

    Sir edge repeat ho to wo kiya Hamiltonian Circuit banega

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

      Yes banega

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

      @@animestaanamv2866 no, hamiltonian means it should cover all the vertices ( exactly once ) without repeating the vertex
      , and agar vertex repeat nai kar sakte toh obvio edge bhi repeat nai kar sakte

  • @hafizghulamhussain-e6q
    @hafizghulamhussain-e6q Рік тому +1

    Asalam o alaikum sir kindly octahedron graph ka eulerian circuit find kr dain

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

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

  • @MrinalMondal-mz5jt
    @MrinalMondal-mz5jt 7 місяців тому

    Bro Direc theorem true for simple graph

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

    Sir apki padhai me meja aa rahahe

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

    you have a mistake in the correction of no 3 . if you start vertices from the below ones that might make a hamiltoin path but not hamiltonian circuit

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

      you have also mistake in the correction of number 4 . you have lots of mistakes

  • @RideR-SAM65
    @RideR-SAM65 2 роки тому +2

    I am filling ans sheet in examination hall waiting for question paper while watching this vedio

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

    nice

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

    Direcs theorem mai : agar Sare vertices ka degree alag alag ho taab formula kaise use karunge ?

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

      Sufficient theorem h bhai....agar theorem apply nahi ho paata tab bhi woh hamiltonian graph ho sakta h...uske liye start vertex aur end vertex same hone chahiye...aur har ek vertex ek he baar include honi chahiye in cycle

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

    Aapne ek bhi theorem nhi batya but thumbnail mai kyon likha hai fir😠

  • @UsmanButt-ii6dc
    @UsmanButt-ii6dc 10 днів тому

    lol