CS173: Discrete Mathematical Structures
Spring 2006
Homework #13
Due 07/05/06, 8a
1. You're given a graph:
a. Give a degree sequence for the graph.
b. Is the graph bipartite (answer without explanation will not be accepted)
c. Draw the subgraph of this graph induced by the vertices {E,F,B,C,G}
d. Draw the complimentary graph.
e. What is the largest complete subgraph that the graph contains?
f. Can you traverse all the vertices starting from A visiting each vertex only
once?
g. Can you traverse all the edges visiting each edge exactly once?
2. Draw a graph with the given properties or prove why no such graph exists.
a. Simple graph (no loops or repeated edges), six vertices each of degree 2
b. Simple graph having degree sequence 3,3,3,3
c. Graph with 6 edges and degree sequence 1,2,3,4,6
d. Simple graph with six vertices and degree sequence 2,2,5,5,5,5
e. A simple bipartite graph with 6 nodes and degree sequence 4,3,3,2,2,2
Docsity.com