Vertex Covers and Vertex Covering Numbers | Graph Theory

Поділитися
Вставка
  • Опубліковано 7 сер 2021
  • We introduce vertex covers, minimum vertex covers, and vertex covering numbers! We'll see some examples and non-examples of vertex covers, as well as minimum vertex covers and some that aren't minimum. The number of vertices in a minimum vertex cover is called the vertex covering number of the graph. We'll discuss why the complement of a vertex cover is an independent vertex set, and see how the covering number plus the independence number is the order of a graph (Gallai identity). We'll also discuss covering numbers of complete graphs, cycles, and complete bipartite graphs. #GraphTheory
    A vertex is said to cover its incident edges. A set of vertices is a vertex cover is if covers every edge in the graph.
    Independent Vertex Sets: • Independent Vertex Set...
    Proof Complement of Vertex Cover is Independent Set: • Complement of Vertex C...
    Proof Covering Number plus Independence Number is Order of Graph: (coming soon)
    Graph Theory playlist: • Graph Theory
    ★DONATE★
    ◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits: / wrathofmathlessons
    ◆ Donate on PayPal: www.paypal.me/wrathofmath
    Thanks to Robert Rennie, Barbara Sharrock, and Rolf Waefler for their generous support on Patreon!
    Thanks to Crayon Angel, my favorite musician in the world, who upon my request gave me permission to use his music in my math lessons: crayonangel.bandcamp.com/
    Follow Wrath of Math on...
    ● Instagram: / wrathofmathedu
    ● Facebook: / wrathofmath
    ● Twitter: / wrathofmathedu
    My Music Channel: / @emery3050

КОМЕНТАРІ • 28

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

    Check out the lesson on independent vertex sets if you need a recap!

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

    Thank you for your explanations - this was missing in my understanding of the NP Reduction between Independent Set and Vertex Cover

  • @PunmasterSTP

    Vertex covering numbers? More like "Very good lectures, that are better than others!" 👍

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

    Thank you, thank you soo muchhh!! 🥺🙌🏻 That’s very helpful of you!

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

    Crystal clear explanation, thank you!!! I love how to explain the definitions of each specific terms, I always get confused by those cause it's hard for me to remember the details, you're literally the math teacher I needed growing up

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

    Great now I get it! Thanks a lot sir!

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

    Thankyou sir, for easy and simple way of explanation.

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

    thanks a lot

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

    Hello and thank you for the helpful video! What is the name of graph theory textbook you mention here?

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

    awesome video!

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

    Thank you

  • @rajeshwarir.k2395
    @rajeshwarir.k2395 2 роки тому

    Co- efficient of chromatic polynomial pls...

  • @jarvisharleii

    Proof Covering Number plus Independence Number is Order of Graph: (coming soon)??

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

    Thank you a lot for your videos. Do u have videos on edge covering? And random graphs? If not would like to have a videos on them. Kindly requesting you to do a videos on those topic. Thank you so much again. 🎉

  • @mariap.9768
    @mariap.9768 Рік тому

    Aww, the proof for a future video never came, it seems. Awesome video regardless!