CMP-200 Discrete Mathematics

1 | P a g e

Al-Sharq College for Science and Technology, Jeddah (K.S.A)
CMP-200: Discrete Mathematics
Homework # 1, due Sunday, 28
rd
September

10.1(3-9) For Exercises 39, determine whether the graph shown has directed or undirected
edges, whether it has multiple edges, and whether it has one or more loops.


10.2.20 Draw these graphs.

10.2.26 For which values of n are these graphs bipartite?



10.3.35 How many vertices and how many edges do these graphs have?


CMP-200 Discrete Mathematics
2 | P a g e

10.2.42 Determine whether each of these sequences is graphic. For those that are, draw a graph
having the given degree sequence.

10.3.9 Represent each of these graphs with an adjacency matrix.

10.3.22 draw the graph represented by the given adjacency matrix.

10.3.47 Describe the row and column of an adjacency matrix of a graph corresponding to an
isolated vertex.
10.3.61 Determine whether the given pair of directed graphs are isomorphic.




10.4.8 What do the connected components of a collaboration graph represent?
10.5.8 Determine whether the given graph has an Euler circuit. Construct such a circuit when one
exists. If no Euler circuit exists, determine whether the graph has an Euler path and construct such
a path if one exists.



CMP-200 Discrete Mathematics
3 | P a g e

10.5.10 Can someone cross all the bridges shown in this map exactly once and return to the
starting point?

10.5.26 For which values of n do these graphs have an Euler circuit?