Hamiltonian Graph | Details|Graph Theory #17

Sdílet
Vložit
  • čas přidán 7. 09. 2024
  • Hamiltonian Grpah is the graph which contains Hamiltonian circuit.
    Euler Grpah video :- • Euler Graph | Euler Ci...
    Complete Graph :- • Classes of Graph (Type...

Komentáře • 40

  • @jigyasaagrawal5876
    @jigyasaagrawal5876 Před 4 lety +9

    sir your videos helped me alot in studying and taking my exam . thank you so much !

  • @saishwadkar4557
    @saishwadkar4557 Před 5 lety +4

    Hi Sir, please make video on P and Np problems NP Complete and NP hard.
    Your teaching style is fantastic!

  • @jigyasaagrawal5876
    @jigyasaagrawal5876 Před 4 lety +1

    your teaching style is fantastic thanks a lot

  • @himaanshu1
    @himaanshu1 Před 5 lety +5

    Thanks for all the videos.. really helped me..

  • @neethu5637
    @neethu5637 Před 3 lety +1

    Ur Teaching Is Amazing i loved it Tqq soo much sir

  • @avisalan6621
    @avisalan6621 Před 15 dny

    thank you for the great and simple explanation. 😊

  • @wonderfulmusiclofi
    @wonderfulmusiclofi Před 2 lety

    I really appreciate your teaching technique...

  • @sheetalhemram21
    @sheetalhemram21 Před 5 lety +4

    Sir upload videos on dirac's and ore's thm. Quickly.

  • @andersonlima4440
    @andersonlima4440 Před rokem

    3:38 How could an edge be visited more than once, if the vertices cannot?

  • @satishkolli5457
    @satishkolli5457 Před 2 lety

    Good explanation sir

  • @judeshello5782
    @judeshello5782 Před 3 lety +1

    Excellent work

  • @reamabdulsalam524
    @reamabdulsalam524 Před rokem

    Hello can you please explain everything about graphs from starting to finish I have a subject which call algorithm which I am struggling teacher is bad so please explain everything from zero from the beginning

  • @shivupatil6403
    @shivupatil6403 Před 4 lety

    Sir pls make classes on planar graphs and it 'theorems. And also on colorability

  • @amonprincefootballdoc6240

    you are a genius

  • @karana2260
    @karana2260 Před 3 lety

    who knew behind our school copies we were looking for best hamiltonian path :D :D

  • @kaustubhpaturi4801
    @kaustubhpaturi4801 Před 3 lety

    But sir, in the third example, if we start from a vertex that lies on the common edge btw the square and the triangle, we will not be visiting all the vertices. Then can we say that it is a hamiltonian cycle?

  • @nallamaruchandrasekhar3094

    sir could you please explain grinberg's theorem and explain how to find hamiltonian cycle using grinberg's theorm

  • @user-pw4qo6ub4x
    @user-pw4qo6ub4x Před rokem

    thanks alot

  • @santhosh........
    @santhosh........ Před 5 lety

    Super sir
    It will be really helpful

  • @st_sk5705
    @st_sk5705 Před 5 lety

    Please make problem solving videos on graphs

  • @nandhushree3914
    @nandhushree3914 Před 4 lety

    PDE sum pls upload sir.your teaching excellence

  • @kanimozhibalaji9925
    @kanimozhibalaji9925 Před 5 lety

    Hi sir pls make a video on isomorphism in graph theory and how to check whether the graph is isomorphism or not.

    • @hemmlo5975
      @hemmlo5975 Před 4 lety +1

      Same nmbr of vertex
      Same nmbr of edges
      Same degree of corresponding vertex

  • @user-ql5ut8rx9o
    @user-ql5ut8rx9o Před 3 lety

    Thank you sir 🤍🙏 .

  • @sreelekhakm524
    @sreelekhakm524 Před 4 lety

    Sir, can you make a vedio for find graph is planar or not

  • @goravchokade1198
    @goravchokade1198 Před 5 lety

    Plz!! Make a video on how to convert an expresion in binary tree..

  • @fitrisalsabilaayuandriani7084

    Thank you so much sirr!!

  • @amitmauryathecoolcoder267

    Thank you, bhaiya...

  • @vasudevans8959
    @vasudevans8959 Před 3 lety

    Sir I want extensions,spiliting field, normal extensions, galos extension, seperable in algebra

  • @govindjangid6201
    @govindjangid6201 Před 4 lety

    Thanks sir ji

  • @shubhamtandan486
    @shubhamtandan486 Před 4 lety

    At 3:39 you are telling we can visit the edge more than once but as per your explanation hamiltonian circuit is a trail and trail has no repeated edges. Please explain this whether I am wrong or some mistake happened at that time ?

    • @rajivmishra103
      @rajivmishra103 Před 4 lety

      repeatation of edge can not be done.

    • @abhyudayakumar24
      @abhyudayakumar24 Před 4 lety

      Repetition of edge is not possible there

    • @ayushgarg5929
      @ayushgarg5929 Před 4 lety

      Nahi kar sakte edge do baar visit warna 2 vertex more than once visit ho jaayenge... chutiya hai teacher

  • @Feenaq87667
    @Feenaq87667 Před 3 lety

    Thanks sir

  • @kaltube4817
    @kaltube4817 Před 3 lety

    keep it up!👍👍

  • @kassadamitie3351
    @kassadamitie3351 Před 4 lety

    I BOUNDARY SO MUCH

  • @epicclips8881
    @epicclips8881 Před 4 lety

    Thank u

  • @alambansdancecompany3
    @alambansdancecompany3 Před 3 lety

    Tnx sir

  • @letsstudywithme5666
    @letsstudywithme5666 Před 2 lety

    I think aap hindi me or better se explain kr skte the