1. Let the degree sequence of a graph G be the sequence of length |V(G)| that contains the degrees of the vertices of G in non-increasing order. (a) For each of the following sequences, either draw a simple graph whose de- gree sequence is equal to that sequence, or explain why such a graph does not exist: (4, 4, 4, 2, 2), (4, 2, 2, 1, 1), (3, 3, 3, 2, 1), (4, 3, 3, 2, 1), (2, 2, 2, 1, 1).

1. Let the degree sequence of a graph G be the sequence of length |V(G)| that contains the degrees of the vertices of G in non-increasing order. (a) For each of the following sequences, either draw a simple graph whose de- gree sequence is equal to that sequence, or explain why such a graph does not exist: (4, 4, 4, 2, 2), (4, 2, 2, 1, 1), (3, 3, 3, 2, 1), (4, 3, 3, 2, 1), (2, 2, 2, 1, 1).

Algebra & Trigonometry with Analytic Geometry

13th Edition

ISBN:9781133382119

Author:Swokowski

Publisher:Swokowski

Chapter10: Sequences, Series, And Probability

Section10.2: Arithmetic Sequences

Problem 64E

See similar textbooks