CS202: Discrete Structures

8.2: The Concept of Graph Degrees

• Think about a graph and imagine some properties that a graph might have that are characteristic of a graph - essential properties, i.e. not superficial properties like the labels for the nodes. Think some more about how we might define quantitative properties, i.e. those properties that take on numeric values. The following subunits present some thinking on these matters. 
  

• 8.2.1: Total Degrees of a Graph

  • University of California, San Diego: Edward Bender and S. Williamson's "Lists, Decisions, and Graphs: Basic Concepts in Graph Theory" URL

    Read Definition 3 on pages GT-4 to GT-5.

• 8.2.2: The Handshake Theorem

  • Wikipedia: "Handshaking Lemma" URL

    Read the article for a description of the handshaking lemma and the degree sum formula.