We can use a graph to visualize the power set of a finite set \(A\text{:}\) let \((\powset{A},E)\) be the directed graph where, for vertices \(B,C \in \powset{A}\) (that is, subsets \(B,C \subseteq A\)), the ordered pair \((B,C)\) is an edge in \(E\) if the following two conditions are satisfied:
\(B \subsetneqq C\text{;}\) and
there does not exist a subset \(D \subseteq A\) such that \(B \subsetneqq D \subsetneqq C\text{.}\)
Note: The second condition is to avoid cluttering the graph with extra edges that do not add any extra information.
So we can draw a graph to represent the subset relationships of \(\powset{A}\text{,}\) with arrows to point from subset to superset.
Figure14.4.2.Directed graph to represent the subset relationships between elements of \(\powset{A}\text{.}\)
It is somewhat natural to draw the graph with the largest subsets of \(A\) at the top (or at the bottom). If we decide that arrows will always point upwards, we can unclutter our graph by just drawing lines instead of arrows for edges.
We can use graphs to visualize other kinds of mathematical relationships.
Example14.4.3.A division graph.
For integers \(m,n\text{,}\) write \(m \mid n\) if \(m\) divides \(n\text{;}\) that is, if \(n/m\) is also an integer. In this case, we say that \(m\) divides \(n\text{.}\)
Set
\begin{equation*}
V = \{2,3,4,5,6,7,8,9,10,11,12,13,14\} \text{.}
\end{equation*}
Let \(G = (V,E)\) be the directed graph where, for integers \(m,n \in V\) with \(m \lt n\text{,}\) the ordered pair \((m,n)\) is an edge in \(E\) if the following two conditions are satisfied:
\(m \mid n\text{;}\)
there does not exist an integer \(\ell \in V\) such that \(m \mid \ell\) and \(\ell \mid n\text{,}\) but \(\ell \ne m,n\text{.}\)
We can use this directed graph to visualize the set \(V\) with respect to the divides relationship. Again, we agree that arrows will always point up, but do not actually draw them. Note that the prime numbers all appear at the bottom.
Figure14.4.4.Directed graph to represent the relationship of division between elements of \(V\text{.}\)
Example14.4.5.Travelling salesman problem.
You get a summer job with the Prospective Student Office at the University of Alberta’s Augustana Campus in Camrose, Alberta. In May and June, your job is to visit Alberta high schools and meet with students who are thinking of applying to Augustana. Below is a map of the cities and towns you must visit, given as a weighted graph with distances in kilometres as weights. To save on gas, you would like to visit each city and town exactly once, and do so while travelling the shortest distance possible.
Figure14.4.6.Road map of major centres in Alberta as a weighted graph.
This is a difficult problem, and gets more difficult as the number of cities and roads increases.
