This lesson focuses on Euler's Equation. Any (finite) graph can be constructed by starting with one vertex and adding more vertices one by one. We have shown that, whichever way we add new vertices, Euler's equation is valid. Therefore it is valid for all graphs. The process we have used is called mathematical induction.

3 Views 0 Downloads

Additional Tags

mathematical induction, euler's formula, euler's equation, graphs and networks, mathigon.org, mathigon: graphs and networks: euler's formula, leonhard euler

Show More Show Less

Classroom Considerations

Knovation Readability Score: 4 (1 low difficulty, 5 high difficulty)
The intended use for this resource is Instructional|practice

View 26,565 other resources for 9th - 10th Grade General Math