On 2D Inverse Problems/Triangulations of surfaces: Difference between revisions
Jump to navigation
Jump to search
imported>JackBot |
(No difference)
|
Latest revision as of 21:51, 9 September 2016
Let G be a graph embedded to a surface such that all faces of G are triangular. Such an embedding is called triangulation.

Exercise (***). Generalize the examples to prove that the spectra of G* and M(G) are equal, except possibly the eigenvalue {6}.
