Skip to main content
Logo image

Exercises 14.6 Exercises

An example graph.
Figure 14.6.1. An example graph.

4.

Given a collection of sets A1,A2,…,An, the intersection graph of the collection is the simple graph that has a vertex for each of the sets in the collection, with two vertices joined by an edge if and only if the two corresponding sets have nonempty intersection. Draw the intersection graph of the following collection of sets.
A1={1,2,3,4,5},A2={2,4,6,8},A3={3,5,12},A4={5,8,10}.

Complement of a graph.

Exercises 5–7 concern the following definition.
complement (of a simple graph G)
the simple graph that has the same vertex set as G, but in which two vertices are joined by an edge if and only if those same two vertices are not joined by an edge in G

7.

Suppose G is a simple graph with n vertices. Determine a relationship between the number of edges in G, the number of edges in the complement of G, and the number of edges in the complete graph Kn with n vertices.
Hint.
Recall that every simple graph with n vertices is a subgraph of Kn.