The Clar Structure of Fullerenes


 Anthony Ellis
 2 years ago
 Views:
Transcription
1 The Clar Structure of Fullerenes Liz Hartung Massachusetts College of Liberal Arts June 12, 2013 Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
2 Introduction A Fullerene is a trivalent plane graph Γ = (V, E, F ) with only pentagonal and hexagonal faces. Fullerenes are designed to model carbon molecules. The vertices represent carbon atoms and the edges represent the chemical bonds between them. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
3 Kekulé Structure Carbon atoms form four covalent bonds. Three of these are "strong" bonds, and one is "weak". In the graphical representation, we draw the three strong bonds. The fourth bond tends to occur as a double bond. Over a fullerene, the edges of a perfect matching correspond to double bonds, called a Kekulé structure. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
4 Fries Number A face in Γ can have 0,1,2, or 3 of its bounding edges in K. The faces that have 3 of their bounding edges in K are called the benzene faces of K. The Fries number of Γ is the maximum number of benzene faces over all Kekule structures of Γ Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
5 Clar Number The Clar number of Γ is the largest independent set of benzene faces over all Kekule structures for Γ. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
6 Face 3colorings We can find lower bounds for the Fries and Clar number of a fullerene based on a partial face 3coloring. In a face 3coloring of a hexagonal patch, we can choose one color class (blue) to be the set of void faces in the Kekulé structure. Let all of the edges not bounding these blue faces be in the Kekulé structure. Over the patch, all faces that are not void are benzene faces. We can choose one of the remaining color classes to be the independent set of benzene faces contributing to the Clar number. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
7 Overview For a fullerene Γ = (V, E, F) the Clar number is bounded above by V 6 2. For small fullerenes, the Clar and Fries numbers have been found through computer searches. We introduce Clar chains, a decomposition of fullerenes. We use Clar chains to construct an improper face 3coloring of the fullerene. This allows us to compute the Clar number directly for certain classes of fullerenes. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
8 Clar Structures A Clar Structure (C, A) for a fullerene Γ is a set of hexagons, C, and edges, A, such that every vertex is incident with exactly one element of C A and at most two edges of A lie on any face of Γ. Given a Clar structure (C, A), we can choose three alternating edges on each face in C. Together with the edges of A, these edges form a Kekulé structure K associated with the Clar structure (C, A). Conversely, given a Kekulé structure K, we can form a Clar structure (C, A): take a maximal independent set of benzene faces to be the set C, and let the remaining edges of K form the set A. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
9 Clar Structures and the Clar Number The Clar number of a fullerene is given by a Clar structure (C, A) with a maximum number of faces in C. Lemma Let Γ = (V, E, F ) be a fullerene with a Clar structure (C, A). Then C = V 6 A 3. Every face in C contains six vertices and every edge in A contains two vertices, so 6 C + 2 A = V. We want to maximize the number of independent benzene faces, so our goal will be to find a Clar structure (C, A) that minimizes A. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
10 Constructing an Improper Face 3coloring We will construct an improper face3 coloring that retains the Clar structure (C, A). For a face f of Γ, we say that an edge a A exits f if a shares exactly one vertex with f and that a lies on f if both vertices of a are incident with f. For a face f of Γ, any face of C adjacent to f is incident with two adjacent vertices on f, as is any edge from A that lies on f. f f f Thus an odd number of edges of A exit a pentagon, an even number of edges of A (possibly zero) exit a hexagon. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
11 Clar Chains For each face f of Γ, we construct a coupling of the edges of A exiting f : Choose edges exiting from adjacent vertices to form a couple if such a pair exists. Continue coupling exit edges from adjacent vertices until either: all edges are coupled; only a pair of edges exiting from opposite vertices of a hexagon remains and these can be coupled; only a single exit edge of a pentagon remains. For each pentagon, we call the uncoupled exit edge the initial edge for that pentagon. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
12 Clar Chains Each edge in A that is not an initial edge from a pentagon has two couplings, one over each face that it exits. The twelve initial edges have at most one coupling. Given a coupling for a fullerene Γ, define a Clar chain in Γ to be an alternating sequence f 0, a 1, f 1, a 2,..., a k, f k of faces f i of Γ and edges a i in A such that a i and a i+1 are coupled edges exiting f i. If f 0 = f k, we say the chain is closed. Otherwise, it is an open chain, where f 0 and f k are the initial edges of pentagons. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
13 Clar Chains The assigned coupling of exit edges over each face determines six open chains between pairs of pentagons and ensures that each edge in A is included in exactly one chain. The chains may share faces but do not cross one another. Lemma Let Γ be a fullerene with a Clar structure (C, A) and a coupling assignment. There are exactly six open Clar chains connecting pairs of pentagons. There may additionally be closed Clar chains. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
14 Expansion and Face 3coloring We define the expansion E(C, A) to be the graph obtained by widening the edges in A into quadrilateral faces. Each vertex incident with an edge in A becomes an edge, and each edge in A splits lengthwise into two edges. All faces in the expansion are of even degree. Theorem (Saaty and Kainen ) A 3regular plane graph is face 3colorable if and only if each face has even degree. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
15 Improper Face 3coloring Lemma The expansion E(C, A) is face 3colorable. All faces of E(C, A) corresponding to faces in C and expanded edges of A will be in one color class. Furthermore, Γ has an associated improper face 3coloring for which the only improperly colored faces are those that share edges of A. If the set C is in the blue color class, all Clar chains in Γ are yellowred or redyellow chains. d i d i ' d i f i1 f i f i1 ' t i ' f i ' t i+1 ' f i1 f i g i g i ' g i Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
16 Coxeter Coordinates To describe open Clar chains, we will use Coxeter coordinates. The distance between a pair of faces is given by their Coxeter coordinates. A shortest dual path between faces can be drawn as two line segments with a 120 left turn between them, or as one line segment. The Coxeter coordinates are given as (m, n), or just (m) in the case with no turn. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
17 Structure of noninterfering chains A straight chain segment is a chain of edges in A and hexagons f i such that the edges a i and a i+1 exit from opposite vertices of f i for each i. A straight chain segment with k edges in A connects a pair of faces with Coxeter coordinates (k, k). Every Clar chain in a fullerene Γ is a sequence of straight chain segments with only sharp turns. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
18 Noninterfering Chains We say that chains are noninterfering if they are separate from other pentagons over the fullerene. P 1 P 1 P 2 P 2 We can only connect two pentagons with a noninterfering Clar chain if they are in the same color class, or equivalently, if the Coxeter coordinates between them are congruent mod 3. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
19 Structure of noninterfering chains If two pentagons can be joined by a noninterfering Clar chain, then any shortest chain between them is composed of alternating right and left turns. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
20 Suppose that the segment between pentagons p 1 and p 2 has Coxeter coordinates (m, n) where m n and m n mod 3. The contribution to A depends on the position of the faces of C around the segment. P 1 P 1 P 2 P 2 If the set of yellow faces contains the set C, this chain will be of Type 1. A chain of Type 1 contributes m edges to A. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
21 Suppose that the segment between pentagons p 1 and p 2 has Coxeter coordinates (m, n) where m n and m n mod 3. P 1 P 1 P 2 P 2 This chain will be of Type 2 if the red faces contain the set C. A chain of Type 2 contributes m + n edges to A. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
22 Suppose that the segment between pentagons p 1 and p 2 has Coxeter coordinates (m, n) where m n and m n mod 3. P 1 P 1 P 2 P 2 If the blue faces in the figure contain the set C, the chain will be of Type 3. A chain of Type 3 contributes 3m + 2 edges to A. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
23 Closed Clar chains Because Clar chains do not cross one another, closed Clar chains must contain an even number of pentagons. A Clar structure that attains the Clar number won t have closed Clar chains that do not contain pentagons (we want to minimize A). Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
24 Widely Separated Let Γ be a fullerene in which there is a noninterfering pairing of pentagons, and the Coxeter coordinates of the segments between each of the pairs are congruent mod 3. For each of the three possible choices for C over Γ, total the number of edges in A resulting for the six chains. Let M be the minimum of these three sums. We define this pairing of pentagons to be widely separated over the fullerene if for any two pentagons that are not paired together, one of the Coxeter coordinates of the segments joining them is at least M 2 2. Theorem Let Γ be a fullerene over which the pairs of pentagons are widely separated. Let M be the minimum sum of the edges of A over the three possible choices for the face set C. Then V 6 M 3 is the Clar number for Γ. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
25 Applications of Widely Separated Chains We can now use this method to compute the Clar number for classes of fullerenes in which the pairs of pentagons are widely separated. Graver s A Catalog of All Fullerenes with Ten or More Symmetries" provides examples for which we can compute the Clar number. It has generally been assumed that a set of independent benzene faces that attains the Clar number for a fullerene will be contained in the set of benzene faces that gives the Fries number. We construct an infinite family of fullerenes that serves as a counterexample. Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, / 25
Class One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More informationPlanarity Planarity
Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?
More informationAngle  a figure formed by two rays or two line segments with a common endpoint called the vertex of the angle; angles are measured in degrees
Angle  a figure formed by two rays or two line segments with a common endpoint called the vertex of the angle; angles are measured in degrees Apex in a pyramid or cone, the vertex opposite the base; in
More informationGeometry: Unit 1 Vocabulary TERM DEFINITION GEOMETRIC FIGURE. Cannot be defined by using other figures.
Geometry: Unit 1 Vocabulary 1.1 Undefined terms Cannot be defined by using other figures. Point A specific location. It has no dimension and is represented by a dot. Line Plane A connected straight path.
More informationThe angle sum property of triangles can help determine the sum of the measures of interior angles of other polygons.
Interior Angles of Polygons The angle sum property of triangles can help determine the sum of the measures of interior angles of other polygons. The sum of the measures of the interior angles of a triangle
More informationSum of Degrees of Vertices Theorem
Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2
More informationLine. A straight path that continues forever in both directions.
Geometry Vocabulary Line A straight path that continues forever in both directions. Endpoint A point that STOPS a line from continuing forever, it is a point at the end of a line segment or ray. Ray A
More informationPlanar Tree Transformation: Results and Counterexample
Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem
More informationPlanar Graph and Trees
Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning
More informationA permutation can also be represented by describing its cycles. What do you suppose is meant by this?
Shuffling, Cycles, and Matrices Warm up problem. Eight people stand in a line. From left to right their positions are numbered,,,... 8. The eight people then change places according to THE RULE which directs
More informationGraph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902
Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Different Graphs, Similar Properties
More informationCS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin
CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationSPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM
SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the
More informationBasic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by
Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn
More informationAngles that are between parallel lines, but on opposite sides of a transversal.
GLOSSARY Appendix A Appendix A: Glossary Acute Angle An angle that measures less than 90. Acute Triangle Alternate Angles A triangle that has three acute angles. Angles that are between parallel lines,
More informationMidterm Practice Problems
6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator
More informationChapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
9 Properties of Trees. Definitions: Chapter 4: Trees forest  a graph that contains no cycles tree  a connected forest. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
More information1 of 69 Boardworks Ltd 2004
1 of 69 2 of 69 Intersecting lines 3 of 69 Vertically opposite angles When two lines intersect, two pairs of vertically opposite angles are formed. a d b c a = c and b = d Vertically opposite angles are
More informationChapter 3.1 Angles. Geometry. Objectives: Define what an angle is. Define the parts of an angle.
Chapter 3.1 Angles Define what an angle is. Define the parts of an angle. Recall our definition for a ray. A ray is a line segment with a definite starting point and extends into infinity in only one direction.
More informationGeometry. Unit 6. Quadrilaterals. Unit 6
Geometry Quadrilaterals Properties of Polygons Formed by three or more consecutive segments. The segments form the sides of the polygon. Each side intersects two other sides at its endpoints. The intersections
More informationExtremal Wiener Index of Trees with All Degrees Odd
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287292 ISSN 03406253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationINFORMATION FOR TEACHERS
INFORMATION FOR TEACHERS The math behind DragonBox Elements  explore the elements of geometry  Includes exercises and topics for discussion General information DragonBox Elements Teaches geometry through
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More information2.3 Scheduling jobs on identical parallel machines
2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationHomework 15 Solutions
PROBLEM ONE (Trees) Homework 15 Solutions 1. Recall the definition of a tree: a tree is a connected, undirected graph which has no cycles. Which of the following definitions are equivalent to this definition
More informationA convex polygon is a polygon such that no line containing a side of the polygon will contain a point in the interior of the polygon.
hapter 7 Polygons A polygon can be described by two conditions: 1. No two segments with a common endpoint are collinear. 2. Each segment intersects exactly two other segments, but only on the endpoints.
More informationCREATION OF OVERLAY TILINGS THROUGH DUALIZATION OF REGULAR NETWORKS. Douglas Zongker
CREATION OF OVERLAY TILINGS THROUGH DUALIZATION OF REGULAR NETWORKS Douglas Zongker Department of Computer Science & Engineering University of Washington Box 352350 Seattle, Washington 981952350 USA dougz@cs.washington.edu
More informationTheorem 5. The composition of any two symmetries in a point is a translation. More precisely, S B S A = T 2
Isometries. Congruence mappings as isometries. The notion of isometry is a general notion commonly accepted in mathematics. It means a mapping which preserves distances. The word metric is a synonym to
More informationEuler Paths and Euler Circuits
Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and
More informationUnknown Angle Problems with Inscribed Angles in Circles
: Unknown Angle Problems with Inscribed Angles in Circles Student Outcomes Use the inscribed angle theorem to find the measures of unknown angles. Prove relationships between inscribed angles and central
More informationShapes Puzzle 1. Shapes Puzzle 2. Shapes Puzzle 3
Shapes Puzzle The twelve pentominoes are shown on the left. On the right, they have been placed together in pairs. Can you show which two pentominoes have been used to make each shape? (Each pentomino
More informationPrinciple of (Weak) Mathematical Induction. P(1) ( n 1)(P(n) P(n + 1)) ( n 1)(P(n))
Outline We will cover (over the next few weeks) Mathematical Induction (or Weak Induction) Strong (Mathematical) Induction Constructive Induction Structural Induction Principle of (Weak) Mathematical Induction
More informationExploring Spherical Geometry
Exploring Spherical Geometry Introduction The study of plane Euclidean geometry usually begins with segments and lines. In this investigation, you will explore analogous objects on the surface of a sphere,
More informationNotes on polyhedra and 3dimensional geometry
Notes on polyhedra and 3dimensional geometry Judith Roitman / Jeremy Martin April 23, 2013 1 Polyhedra Threedimensional geometry is a very rich field; this is just a little taste of it. Our main protagonist
More informationChapter 4. Trees. 4.1 Basics
Chapter 4 Trees 4.1 Basics A tree is a connected graph with no cycles. A forest is a collection of trees. A vertex of degree one, particularly in a tree, is called a leaf. Trees arise in a variety of applications.
More informationangle Definition and illustration (if applicable): a figure formed by two rays called sides having a common endpoint called the vertex
angle a figure formed by two rays called sides having a common endpoint called the vertex area the number of square units needed to cover a surface array a set of objects or numbers arranged in rows and
More informationPostulate 17 The area of a square is the square of the length of a. Postulate 18 If two figures are congruent, then they have the same.
Chapter 11: Areas of Plane Figures (page 422) 111: Areas of Rectangles (page 423) Rectangle Rectangular Region Area is measured in units. Postulate 17 The area of a square is the square of the length
More informationDEFINITIONS. Perpendicular Two lines are called perpendicular if they form a right angle.
DEFINITIONS Degree A degree is the 1 th part of a straight angle. 180 Right Angle A 90 angle is called a right angle. Perpendicular Two lines are called perpendicular if they form a right angle. Congruent
More informationMath Dictionary Terms for Grades K1:
Math Dictionary Terms for Grades K1: A Addend  one of the numbers being added in an addition problem Addition  combining quantities And  1) combine, 2) shared attributes, 3) represents decimal point
More informationLesson 6: Polygons and Angles
Lesson 6: Polygons and Angles Selected Content Standards Benchmark Assessed: G.4 Using inductive reasoning to predict, discover, and apply geometric properties and relationships (e.g., patty paper constructions,
More information1. Relevant standard graph theory
Color identical pairs in 4chromatic graphs Asbjørn Brændeland I argue that, given a 4chromatic graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4coloring
More informationRules of angles (7 9)
Rules of angles (7 9) Contents asic rules of angles Angles in parallel lines (7 9) 3 Angles in polygons (year 9) 4 3. The central angle in a regular polygon...................... 4 3. The exterior angle
More informationConstruction and Properties of the Icosahedron
Course Project (Introduction to Reflection Groups) Construction and Properties of the Icosahedron Shreejit Bandyopadhyay April 19, 2013 Abstract The icosahedron is one of the most important platonic solids
More informationCacti with minimum, secondminimum, and thirdminimum Kirchhoff indices
MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 4758 (2010) Cacti with minimum, secondminimum, and thirdminimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang
More informationCOLORED GRAPHS AND THEIR PROPERTIES
COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring
More informationOn planar regular graphs degree three without Hamiltonian cycles 1
On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.
More informationWeek 2 Polygon Triangulation
Week 2 Polygon Triangulation What is a polygon? Last week A polygonal chain is a connected series of line segments A closed polygonal chain is a polygonal chain, such that there is also a line segment
More informationCircle Name: Radius: Diameter: Chord: Secant:
12.1: Tangent Lines Congruent Circles: circles that have the same radius length Diagram of Examples Center of Circle: Circle Name: Radius: Diameter: Chord: Secant: Tangent to A Circle: a line in the plane
More informationGeometry Vocabulary. Created by Dani Krejci referencing:
Geometry Vocabulary Created by Dani Krejci referencing: http://mrsdell.org/geometry/vocabulary.html point An exact location in space, usually represented by a dot. A This is point A. line A straight path
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDEBERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More information61. Pascal s Hexagon Theorem.
. Pascal s Hexagon Theorem. Prove that the three points of intersection of the opposite sides of a hexagon inscribed in a conic section lie on a straight line. Hexagon has opposite sides,;, and,. Pascal
More informationActivity Set 4. Trainer Guide
Geometry and Measurement of Plane Figures Activity Set 4 Trainer Guide Int_PGe_04_TG GEOMETRY AND MEASUREMENT OF PLANE FIGURES Activity Set #4 NGSSS 3.G.3.1 NGSSS 3.G.3.3 NGSSS 4.G.5.1 NGSSS 5.G.3.1 Amazing
More information6. GRAPH AND MAP COLOURING
6. GRPH ND MP COLOURING 6.1. Graph Colouring Imagine the task of designing a school timetable. If we ignore the complications of having to find rooms and teachers for the classes we could propose the following
More informationSolutions to Exercises, Section 6.1
Instructor s Solutions Manual, Section 6.1 Exercise 1 Solutions to Exercises, Section 6.1 1. Find the area of a triangle that has sides of length 3 and 4, with an angle of 37 between those sides. 3 4 sin
More informationThe Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs The degreediameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
More informationInteractive Math Glossary Terms and Definitions
Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Additive Property of Area the process of finding an the area of a shape by totaling the areas
More informationparallel lines perpendicular lines intersecting lines vertices lines that stay same distance from each other forever and never intersect
parallel lines lines that stay same distance from each other forever and never intersect perpendicular lines lines that cross at a point and form 90 angles intersecting lines vertices lines that cross
More information2000 Solutions Fermat Contest (Grade 11)
anadian Mathematics ompetition n activity of The entre for Education in Mathematics and omputing, University of Waterloo, Waterloo, Ontario 000 s Fermat ontest (Grade ) for The ENTRE for EDUTION in MTHEMTIS
More information6. Planarity. Fig Fig. 6.2
6. Planarity Let G(V, E) be a graph with V = {v 1, v 2,..., v n } and E = {e 1, e 2,..., e m }. Let S be any surface (like the plane, sphere) and P = {p 1, p 2,..., p n } be a set of n distinct points
More informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
More informationIntroduction to Voronoi Diagrams
C.S. 252 Prof. Roberto Tamassia Computational Geometry Sem. II, 1992 1993 Lecture 13 Date: March 22, 1993 Scribe: Scott S. Snibbe 1 Introduction Introduction to Voronoi Diagrams This lecture introduces
More informationLines That Pass Through Regions
: Student Outcomes Given two points in the coordinate plane and a rectangular or triangular region, students determine whether the line through those points meets the region, and if it does, they describe
More informationBASIC GEOMETRY GLOSSARY
BASIC GEOMETRY GLOSSARY Acute angle An angle that measures between 0 and 90. Examples: Acute triangle A triangle in which each angle is an acute angle. Adjacent angles Two angles next to each other that
More informationEVERY DAY COUNTS CALENDAR MATH 2005 correlated to
EVERY DAY COUNTS CALENDAR MATH 2005 correlated to Illinois Mathematics Assessment Framework Grades 35 E D U C A T I O N G R O U P A Houghton Mifflin Company YOUR ILLINOIS GREAT SOURCE REPRESENTATIVES:
More information4. An isosceles triangle has two sides of length 10 and one of length 12. What is its area?
1 1 2 + 1 3 + 1 5 = 2 The sum of three numbers is 17 The first is 2 times the second The third is 5 more than the second What is the value of the largest of the three numbers? 3 A chemist has 100 cc of
More informationSection 12.1 Translations and Rotations
Section 12.1 Translations and Rotations Any rigid motion that preserves length or distance is an isometry (meaning equal measure ). In this section, we will investigate two types of isometries: translations
More informationIntroduction to the Mathematics of Zome
Introduction to the Mathematics of Zome Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles July 1, 008 Abstract This article provides a gentle introduction to the Mathematics of Zome,
More informationFirst Grade CCSS Math Vocabulary Word List *Terms with an asterisk are meant for teacher knowledge only students do not need to learn them.
First Grade CCSS Math Vocabulary Word List *Terms with an asterisk are meant for teacher knowledge only students do not need to learn them. Add To combine; put together two or more quantities. Addend Any
More information6. Angles. a = AB and b = AC is called the angle BAC.
6. Angles Two rays a and b are called coterminal if they have the same endpoint. If this common endpoint is A, then there must be points B and C such that a = AB and b = AC. The union of the two coterminal
More informationGeometry Unit 1. Basics of Geometry
Geometry Unit 1 Basics of Geometry Using inductive reasoning  Looking for patterns and making conjectures is part of a process called inductive reasoning Conjecture an unproven statement that is based
More informationGeometry Review Flash Cards
point is like a star in the night sky. However, unlike stars, geometric points have no size. Think of them as being so small that they take up zero amount of space. point may be represented by a dot on
More informationAnalysis of Algorithms, I
Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadthfirst search (BFS) 4 Applications
More informationConnections between decomposition trees of 3connected plane triangulations and hamiltonian properties
Introduction Hamiltonicity Other hamiltonian properties Connections between decomposition trees of 3connected plane triangulations and hamiltonian properties Gunnar Brinkmann Jasper Souffriau Nico Van
More informationPolygons are figures created from segments that do not intersect at any points other than their endpoints.
Unit #5 Lesson #1: Polygons and Their Angles. Polygons are figures created from segments that do not intersect at any points other than their endpoints. A polygon is convex if all of the interior angles
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More informationCK12 Geometry: Exploring Solids
CK12 Geometry: Exploring Solids Learning Objectives Identify different types of solids and their parts. Use Euler s formula to solve problems. Draw and identify different views of solids. Draw and identify
More informationGraphical degree sequences and realizations
swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS  Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös
More information13. Write the decimal approximation of 9,000,001 9,000,000, rounded to three significant
æ If 3 + 4 = x, then x = 2 gold bar is a rectangular solid measuring 2 3 4 It is melted down, and three equal cubes are constructed from this gold What is the length of a side of each cube? 3 What is the
More informationCS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992
CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992 Original Lecture #6: 28 January 1991 Topics: Triangulating Simple Polygons
More information1. Determine all real numbers a, b, c, d that satisfy the following system of equations.
altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c
More informationTessellations. A tessellation is created when a shape is repeated over and over again to cover the plane without any overlaps or gaps.
Tessellations Katherine Sheu A tessellation is created when a shape is repeated over and over again to cover the plane without any overlaps or gaps. 1. The picture below can be extended to a tessellation
More informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More information11.3 Curves, Polygons and Symmetry
11.3 Curves, Polygons and Symmetry Polygons Simple Definition A shape is simple if it doesn t cross itself, except maybe at the endpoints. Closed Definition A shape is closed if the endpoints meet. Polygon
More informationSpring 2007 Math 510 Hints for practice problems
Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an chessboard There are doors between all adjacent cells A prisoner in one
More informationInscribed Angle Theorem and Its Applications
: Student Outcomes Prove the inscribed angle theorem: The measure of a central angle is twice the measure of any inscribed angle that intercepts the same arc as the central angle. Recognize and use different
More informationHOMEWORK #3 SOLUTIONS  MATH 3260
HOMEWORK #3 SOLUTIONS  MATH 3260 ASSIGNED: FEBRUARY 26, 2003 DUE: MARCH 12, 2003 AT 2:30PM (1) Show either that each of the following graphs are planar by drawing them in a way that the vertices do not
More informationA polygon with five sides is a pentagon. A polygon with six sides is a hexagon.
Triangles: polygon is a closed figure on a plane bounded by (straight) line segments as its sides. Where the two sides of a polygon intersect is called a vertex of the polygon. polygon with three sides
More informationChapter One. Points, Lines, Planes, and Angles
Chapter One Points, Lines, Planes, and Angles Objectives A. Use the terms defined in the chapter correctly. B. Properly use and interpret the symbols for the terms and concepts in this chapter. C. Appropriately
More informationMonotone Partitioning. Polygon Partitioning. Monotone polygons. Monotone polygons. Monotone Partitioning. ! Define monotonicity
Monotone Partitioning! Define monotonicity Polygon Partitioning Monotone Partitioning! Triangulate monotone polygons in linear time! Partition a polygon into monotone pieces Monotone polygons! Definition
More informationSolutions to Exercises 8
Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.
More informationSHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE
SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless
More informationRhombopolyclonic Polygonal Rosettes Theory
Rhombopolyclonic Polygonal Rosettes Theory François TARD 1, rue Pierre Mille 75015 Paris tard.françois@wanado.fr Abstract The division of a regular polygon with an even numbers of vertices into a whole
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More information22.1 Interior and Exterior Angles
Name Class Date 22.1 Interior and Exterior ngles Essential Question: What can you say about the interior and exterior angles of a triangle and other polygons? Resource Locker Explore 1 Exploring Interior
More informationLesson 13: Proofs in Geometry
211 Lesson 13: Proofs in Geometry Beginning with this lesson and continuing for the next few lessons, we will explore the role of proofs and counterexamples in geometry. To begin, recall the Pythagorean
More information