Explore BrainMass

Undergrad 400 level Topology.

Find a tree in the polyhedron of figure 1.3 which contains all the vertices. Construct the dual graph Г and show that Г contains loops. (You don't have to construct the graph, but please describe it to me how it looks like.) (SEE ATTACHMENT)