On 2D Inverse Problems/Triangulations of surfaces

From testwiki
Revision as of 21:51, 9 September 2016 by imported>JackBot (top: using AWB)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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
Medial graph of triangulation

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

σ(G*){6}=σ(M(G)){6}
Medial graph
Medial graph

Template:BookCat