Discrete Mathematics and Proof · Chapter 10 · Lesson 10.1 · Printable PDF

Degree, the Handshake Lemma and Complete Graphs Worksheet with Answer Key

8 problems on degree, the handshake lemma and complete graphs. 3 pages, with a worked answer key.

8 problems3 pagesanswer key
Printable Degree, the handshake lemma and complete graphs worksheet with answer key - Discrete Mathematics and Proof (Page 1 PDF preview)
Page 1 of 3

Get this sheet

This sheetWorksheet and answer key, yours to keep.
$5
Buy
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
Subscribe
Full Course Set470+ Discrete Mathematics and Proof PDF files, no limit, yours to keep.
$400once
Buy

Try one first: a free Chapter 1 worksheet (PDF, no sign-in).

The full Discrete Mathematics and Proof courseEvery lesson in teaching order, with over 470 printables.See the course ›

What's on the worksheet

  1. Decide whether each list is graphic.
    (6, 5, 4, 3, 2, 1)(7, 6, 5, 4, 3, 2, 1, 1)(3, 3, 3, 1)(4, 4, 4, 2, 2, 0)(5, 3, 3, 3, 3, 3, 2)
  2. a b c d e f g The figure shows a graph G with vertices a to g.
  3. In a study app, two users can agree to be study partners, and being partners is mutual.
  4. Hannah's chess club has 12 players and is running a round robin:
  5. Seven weather stations A to G are to be joined by radio links, each link joining two stations, so that every station is linked directly to at least…
  6. At a workshop, every two of the people present shook hands exactly once.
  7. Let G be a graph with n vertices, and suppose that G and its complement G are both r-regular, for the same number r.
  8. Let n ≥ 2, and let G be an (n - 2)-regular graph on n vertices.

Teach it first

The free lesson teaches it with worked examples and practice problems.

Degree, the handshake lemma and complete graphs: the lesson ›