Graphs And Polyhedra

From Karnataka Open Educational Resources
Jump to navigation Jump to search

The Story of Mathematics

Philosophy of Mathematics

Teaching of Mathematics

Curriculum and Syllabus

Topics in School Mathematics

Textbooks

Question Bank

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

NCERT book on Graphs

Additional Information

Useful websites

Wikipedia page for Graph Theory

For More Informations on Platonic Solids

Reference Books

http://dsert.kar.nic.in/textbooksonline/Text%20book/Kannada/class%20x/maths/Kannada-class%20x-maths-contents.pdf

Teaching Outlines

  1. Defining a Graph, node arc and Region
  2. Framing Euler's Formula for graphs
  3. Verifying Euler's Formula N + R = A + 2 for given Plane graphs
  4. Drawing graphs for given N,R and A
  5. Identifying the Traversible graphs
  6. Explaining and using the condition for Traversible graphs
  7. defining a Polyhedra
  8. Framing Euler's formula for Polyhedra
  9. verifying Euler's formula for the given Polyhedra


Concept

Representation of a Graph

Learning objectives

  1. To define what is node.
  2. to define what is arc
  3. To define what is Region
  4. To represent a Graph with node, Arc and Regions

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

  1. Activity No #1

Introduction to Graphs


  1. 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

  1. Activity No #1
  2. 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. koning4.jpg


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