Edge Covers and Edge Covering Numbers of Graphs | Graph Theory [EuViyGZlGMl]

Edge Covers and Edge Covering Numbers of Graphs | Graph Theory [EuViyGZlGMl]

| 1h 28m 28s | Video has closed captioning.

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: Graph Theory course: Graph Theory exercises: ◉Textbooks I Like◉ Graph Theory: Real Analysis: Proofs and Set Theory: (available for free online) Statistics: Abstract Algebra: Discrete Math: Number Theory: ★DONATE★ ◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits: ◆ Donate on PayPal: 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: Follow Wrath of Math on... ● Instagram: ● Facebook: ● Twitter: My Math Rap channel: