grafovi

grafovi - Graphtheoryasamethodof...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
    Graph theory as a method of  improving chemistry and mathematics  curricula  Franka M. Brückler Dept. of Mathematics, University of Zagreb  (Croatia) Vladimir Stilinović Dept. of Chemistry, University of Zagreb (Croatia)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
    Problem(s) • school mathematics: dull? too  complicated? to technical? • various subjects taught in school: to  separated from each other? from the  real life? • possible solutions?
Background image of page 2
    Fun in school • fun and math/chemistry -  a contradiction? • can you draw the picture traversing each line  only once? – Eulerian tours • is it possible to traverse a chessboard with a  knight so that each field is visited once? –  Hamiltonian circuits
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
    Graphs • vertices (set V) and edges (set E) – drawn as  points and lines • the set of edges in an (undirected) graph can  be considered as a subset of  P (V) consisting of  one- and two-member sets • history: Euler, Cayley
Background image of page 4
    Basic notions adjacency  –  u , v  adjacent if { u , v } edge vertex degrees  –  number of adjacent vertices • paths  –  sequences  u 1 u 2 ... u n  such that each { u i , u i+1 } is  and edge + no multiple edges circuits  –  closed paths cycles  – circuits with all vertices appearing only once simple graphs   – no loops and no multiple edges connected graphs  –  every two vertices connected by a  path trees  –  connected graph without cycles
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
    Graphs in chemistry molecular (structural) graphs   (often: hydrogen-supressed)  • degree of a vertex = valence of atom
Background image of page 6
     reaction graphs  –  union of the molecular graphs of the  supstrate and the product C C C C C C 2 : 1 2 : 1 2 : 1 0 : 1 0 : 1 1 : 2 Diels-Alder reaction
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
    Mathematical trees grow in chemistry • molecular graphs of acyclic compounds are  trees • example: alkanes • basic fact about trees: |V| = |E| + 1 • basic fact about graphs: 2|E| = sum of all  vertex degrees 5–isobutyl–3–isopropyl–2,3,7,7,8-pentamethylnonan
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/11/2011 for the course MATH 110 taught by Professor Staff during the Winter '08 term at BYU.

Page1 / 25

grafovi - Graphtheoryasamethodof...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online