a. Find the complement of the graph K4, the complete
graph on four vertices. (See Example 1)
b. Find the complement of the graph K3,2, the complete bipartite graph on (3, 2) vertices. (See Example 2)
Complete Graphs on n Vertices: K1, K2, K3, K4, K5
The complete graphs K1, K2, K3, K4, and K5 can be drawn as follows:
In yet another class of graphs, the vertex set can be separated into two subsets: Each vertex in one of the subsets is connected by exactly one edge to each vertex in the other subset, but not to any vertices in its own subset. Such a graph is called complete bipartite.
Complete Bipartite Graphs: K3,2 and K3,3
The complete bipartite graphs K3,2 and K3,3 are illustrated below.
Section 2.5 David Holmes STAT 250 Feb 10 Interpreting Graphs Making Appropriate Graphs Misleading Graphs Appropriate Graphs & Measures The first step in almost every investigation of data is to make an appropriate graph! The type of data you are dealing with determines: Example 2.19: Cell Phone Usage This graph shows...