5.2.2. Questions

Try these first

1. 1.

   What is a degree sequence?

   Hint

   Think about how degrees correspond to edges.

2. 2.

   Can a sequence with negative values be a graphic sequence?

   Hint

   Recall the definition of graphic sequences.

3. 3.

   What is a degree sequence?

   • List of edges
   • List of vertex degrees
   • List of vertices

   Hint

   Remember it relates to how many edges connect to a vertex.

4. 4.

   Is (6,5,4,3,2,1) a graphic sequence?

   • True
   • False

   Hint

   Check the sum of the degrees.

5. 5.

   Given a sequence (0,3,2,2,3), determine if it is graphic and explain your reasoning.

   Hint

   Check if a vertex can connect with others based on given degrees.

6. 6.

   Use the Havel-Hakimi theorem on (5,4,4,3,1) and discuss the process, including every reduction step.

   Hint

   Follow the theorem's process closely.