Indegree and Outdegree in Directed Graphs | Graph Theory

We describe the indegrees and the outdegrees of vertices in directed graphs in detail, with examples and practice problems. Recall in a digraph edges have direction, and so are called directed edges or "arcs". These are represented by ordered pairs of vertices like (u,v). The arc (u,v) goes from u and to v. The outdegree of a vertex is the number of arcs going out of it, the indegree of a vertex is the number of arcs going to it (or into it, if you prefer). #GraphTheory Intro to Directed Graphs:    • Intro to Directed Graphs | Digraph Th...   First Theorem of Digraph Theory:    • First Theorem of Directed Graphs | Di...   Intro to Tournaments:    • Intro to Tournament Graphs | Graph Th...   Graph Theory Playlist:    • Graph Theory   ★DONATE★ ◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits: www.patreon.com/join/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: www.instagram.com/wrathofmathedu ● Facebook: www.facebook.com/WrathofMath ● Twitter: twitter.com/wrathofmathedu My Music Channel:    / @emery3050  

• #
• #wrath_of_math
• #math_lessons
• #math
• #education
• #math_video
• #digraph
• #directed_graph
• #arcs_directed_graphs
• #outdegree
• #indegree
• #outdegree_and_indegree
• #directed_graph_degree
• #first_theorem_of_digraph_theory