How to draw Cayley Graph || Group Theory

Sdílet
Vložit
  • čas přidán 29. 06. 2024
  • Let's talk about Cayley Graphs and learn how to draw them. They are very powerful tools in Group Theory.
    Visit www.cheenta.com/ for Advanced Mathematics.
    Watch the playlist on ISI & CMI Entrance:-
    czcams.com/users/playlist?list...
    Follow us at:
    Facebook:-
    / cheentamath
    Instagram:-
    / cheentamath
    Linkedin:-
    / chee. .
    Happy learning!

Komentáře • 20

  • @srinjoychaudhuri32
    @srinjoychaudhuri32 Před 4 lety +4

    Thank u sir...to give us the idea of some higher mathematics thinking....#keep on making these great videos...😊❤️

  • @tutorpedia123
    @tutorpedia123 Před 3 lety

    Great sir thanks a lot

  • @rianfebrianumbara2917
    @rianfebrianumbara2917 Před 3 lety

    thank you for the explanation

  • @thinkingpi
    @thinkingpi Před 4 lety +3

    As always, great work sir. Keep on making these wonderful videos. Also sir.
    I have a question, Dose given any graph we can find some sort for group, or only some types of graph can do? Thanks in advance

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

      Great question. Not all graphs will works. For instance the graph should be connected.... and there are other conditions.

    • @thinkingpi
      @thinkingpi Před 4 lety

      @@Cheenta Thank you sir. I will definitely try to learn more about it. Again Thanks for this nice video.

  • @nvijaya2281
    @nvijaya2281 Před 10 měsíci

    Very much clear explanation

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

    Thank u sir

  • @muktiacharya6642
    @muktiacharya6642 Před 2 lety +1

    Nice explaining to draw a Cayley graph on G whose elements are reduced residue class of 8. Edges are created taking the elements of generating set. Let me take the vertices as the set { 1,2,3,4,5,6,7 }. How to draw the Cayley graph on this set ?

    • @AbrahamHoffman
      @AbrahamHoffman Před rokem

      According to the video, you have to choose a generating set. Once you have that generating set, perform the "star" operation x -> x*s. Then you draw an edge from the vertex 'x' to the resultant 'x*s'.

    • @archismandas7760
      @archismandas7760 Před 11 měsíci

      What is the operation ?

    • @archismandas7760
      @archismandas7760 Před 11 měsíci

      First you need to have a binary operation,
      For the set you gave...
      If you add the number 0 to the set and define a binary operation where you add two numbers in the given set and divide the sum by 8 and write the remainder
      The set along with that binary operation becomes a group.
      In that case the generating sets are {1} or {3} or {5} or {7}.

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

    What you described is the undirected Cayley graph

  • @vijigeorge8672
    @vijigeorge8672 Před 2 lety

    THANK YOU

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

    pleas van you help me prove operation in cayley graph no paralle

  • @Arseus
    @Arseus Před rokem +1

    Is HCF common? I’ve always called it GCD

    • @Cheenta
      @Cheenta  Před rokem

      Yes in some countries like India, HCF is used. In other countries GCD is more common.