On 2D Inverse Problems/Triangulations of surfaces
Jump to navigation
Jump to search
![Medial graph of triangulation](//upload.wikimedia.org/wikipedia/commons/thumb/b/be/Medial_graph_and_triangulation.jpg/400px-Medial_graph_and_triangulation.jpg)
Medial graph of triangulation
![Medial graph](//upload.wikimedia.org/wikipedia/commons/thumb/4/43/Medial_graph_alone.jpg/400px-Medial_graph_alone.jpg)
Medial graph
Let G be a graph embedded to a surface such that all faces of G are triangular. Such an embedding is called triangulation.
![Medial graph of triangulation](http://upload.wikimedia.org/wikipedia/commons/thumb/b/be/Medial_graph_and_triangulation.jpg/400px-Medial_graph_and_triangulation.jpg)
Exercise (***). Generalize the examples to prove that the spectra of G* and M(G) are equal, except possibly the eigenvalue {6}.
![Medial graph](http://upload.wikimedia.org/wikipedia/commons/thumb/4/43/Medial_graph_alone.jpg/400px-Medial_graph_alone.jpg)