SlideServe
Menu
Préférences
© SlideServe · v2026

Exploring Euler Characteristic on Graphs

whitakerj avatar
21 diapositives · 283 Views · Jan 05, 2020

Understand Euler Characteristic on different surfaces through graph theory. Learn how to draw connected graphs with no edge crossings. Explore applications to solid shapes and surfaces.

Exploring Euler Characteristic on Graphs - slide 1
01 / 21Exploring Euler Characteristic on Graphs
1 / 17

Télécharger la présentation

Exploring Euler Characteristic on Graphs
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation
  1. Chapter 6: Graphs6.2 The Euler Characteristic

  2. Draw A Graph! • Any connected graph you want, but don’t make it too simple or too crazy complicated • Only rule: No edges can cross (unless there’s a vertex where they’re crossing) OK: Not OK:

  3. Now Count on Your Graph • Number of Vertices: V = ? • Number of Edges E = ? • Number of Regions (including the region outside your graph) R = ?

  4. V-E+R: The Euler Characteristic ANY connected graph drawn on a flat plane with no edge crossings will have the same value for V-E+R: it will always be 2. (We’ll talk about why in a minute.)

  5. V-E+R: The Euler Characteristic ANY connected graph drawn on a flat plane with no edge crossings will have the same value for V-E+R: it will always be 2. (We’ll talk about why in a minute.) The value of V-E+R for a surface is called its Euler Characteristic, so the Euler Characteristic for the plane is 2.

  6. V-E+R: The Euler Characteristic The Euler Characteristic is different on different surfaces. More on this later. For now, we’re going to stick with graphs on a flat plane.

  7. Why is V-E+R=2 on a flat plane? Start with simplest possible graph, count V-E+R: Now, to draw any connected graph at all, you can do it by just adding to this in 2 different ways, over and over.

  8. Adding an Edge but no Vertex • How does this change V? E? R? • How does this change V-E+R?

  9. Adding an Edge to a new Vertex • How does this change V? E? R? • How does this change V-E+R?

  10. So… …we can draw ANY connected graph on a flat plane by starting with the basic one-edge, two-vertex graph and building it up step by step.

  11. So… …we can draw ANY connected graph on a flat plane by starting with the basic one-edge, two-vertex graph and building it up step by step. …the starting graph has V-E+R=2, and each step keeps that unchanged.

  12. So… …we can draw ANY connected graph on a flat plane by starting with the basic one-edge, two-vertex graph and building it up step by step. …the starting graph has V-E+R=2, and each step keeps that unchanged. …therefore, whatever graph we end up with still has V-E+R=2!

  13. Other Surfaces: Spheres • Think of graph drawn on a balloon. Then flatten it out: • Same V, E, R, so same Euler Characteristic!

  14. Other Surfaces: Torus But some surfaces have different Euler Characteristics, for example a torus (donut): The Euler Characteristic of a torus is 0, not 2.

  15. Application to 3-D Solid Shapes We can think of “inflating” a polyhedron with colored edges and corners until it looks like a graph on a sphere: Th This comes from a cube.

  16. Application to 3-D Solid Shapes

  17. Application to 3-D Solid Shapes This lets us finally see why there are only 5 regular polyhedra!

  18. Application to 3-D Solid Shapes

  19. Application to 3-D Solid Shapes

  20. Application to 3-D Solid Shapes

  21. Application to 3-D Solid Shapes