The Zig-Zag Graph
Challenge: See if you can complete the practice exercises about the graph below.
1.What is the minimum amount of colors needed to color every vertex so that no adjacent vertices are the same color? Color the vertices on the graph to show this.
2.What is the minimum amount of colors needed to color every edge so that no adjacent edges are the same color? Color the edges on the graph to show this.
3. Move around the vertices and edges of Graph I to show it is isomorphic to Graph J.
Arissa, Created with GeoGebra |