Difference between revisions of "Graphs And Polyhedra"
| Line 49: | Line 49: | ||
| − | ==Concept | + | ==Concept== |
'''Represemtation of a Graph''' | '''Represemtation of a Graph''' | ||
===Learning objectives=== | ===Learning objectives=== | ||
Revision as of 09:21, 9 July 2014
| Philosophy of Mathematics |
While creating a resource page, please click here for a resource creation checklist.
Concept Map
Error: Mind Map file Graphs And Polyhedrons.mm not found
Textbook
Additional Information
Useful websites
Wikipedia page for Graph Theory
For More Informations on Platonic Solids
Reference Books
Teaching Outlines
- Defining a Graph, node arc and Region
- Framing Euler's Formula for graphs
- Verifying Euler's Formula N + R = A + 2 for given Plane graphs
- Drawing graphs for given N,R and A
- Identifying the Traversible graphs
- Explaining and using the condition for Traversible graphs
- defining a Polyhedra
- Framing Euler's formula for Polyhedra
- verifying Euler's formula for the given Polyhedra
Concept
Represemtation of a Graph
Learning objectives
Notes for teachers
These are short notes that the teacher wants to share about the concept, any locally relevant information, specific instructions on what kind of methodology used and common misconceptions/mistakes.
Activities
- Activity No #1
Introduction to Graphs
- Activity No #2
Concept #
Learning objectives
Notes for teachers
These are short notes that the teacher wants to share about the concept, any locally relevant information, specific instructions on what kind of methodology used and common misconceptions/mistakes.
Activities
- Activity No #1
- Activity No #2
Assessment activities for CCE
Hints for difficult problems
Statement : The Königsberg bridge problem : if the seven bridges of the city of Königsberg (left figure; Kraitchik 1942), formerly in Germany but now known as Kaliningrad and part of Russia, over the river Preger can all be traversed in a single trip without doubling back, with the additional requirement that the trip ends in the same place it began. This is equivalent to asking if the multigraph on four nodes and seven edges (right figure) has an Eulerian cycle. This problem was answered in the negative by Euler (1736), and represented the beginning of graph theory.
Image Courtesy : http://mathworld.wolfram.com/KoenigsbergBridgeProblem.html
Project Ideas
Math Fun
Usage
Create a new page and type {{subst:Math-Content}} to use this template