We introduce edge covers, edge covering numbers, and minimum edge covers of graphs. An edge cover of a graph G is a set L such that every vertex of G is incident to some edge of L. Every graph with no isolated vertices has an edge cover. An edge cover of minimum cardinality is a minimum edge cover, and the cardinality of such a cover is the edge covering number of the graph. We see some edge cover examples and discuss some facts about edge covers of graphs. #graphtheory
Vertex Covers and Vertex Covering Numbers: • Vertex Covers and Vert...
Graph Theory course: • Graph Theory
Graph Theory exercises: • Graph Theory Exercises
◉Textbooks I Like◉
Graph Theory: amzn.to/3JHQtZj
Real Analysis: amzn.to/3CMdgjI
Proofs and Set Theory: amzn.to/367VBXP (available for free online)
Statistics: amzn.to/3tsaEER
Abstract Algebra: amzn.to/3IjoZaO
Discrete Math: amzn.to/3qfhoUn
Number Theory: amzn.to/3JqpOQd
★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 Petar, dric, Rolf Waefler, Robert Rennie, Barbara Sharrock, Joshua Gray, Karl Kristiansen, Katy, Mohamad Nossier, and Shadow Master 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 Math Rap channel: / @mathbars2020