The Clar Structure of Fullerenes
|
|
- Anthony Ellis
- 8 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 3-colorings We can find lower bounds for the Fries and Clar number of a fullerene based on a partial face 3-coloring. In a face 3-coloring 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 3-coloring 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 3-coloring We will construct an improper face-3 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 3-coloring 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 3-regular plane graph is face 3-colorable 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 3-coloring Lemma The expansion E(C, A) is face 3-colorable. 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 3-coloring 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 yellow-red or red-yellow chains. d i d i ' d i f i-1 f i f i-1 ' t i ' f i ' t i+1 ' f i-1 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 non-interfering 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 Non-interfering Chains We say that chains are non-interfering 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 non-interfering 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 non-interfering chains If two pentagons can be joined by a non-interfering 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 non-interfering 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
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
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 informationClass 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 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 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 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 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 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 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 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 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 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 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 informationExtremal Wiener Index of Trees with All Degrees Odd
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of
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 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 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 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 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 informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
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) 11-1: 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 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 informationOptimal 3D Angular Resolution for Low-Degree Graphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 17, no. 3, pp. 173 200 (2013) DOI: 10.7155/jgaa.00290 Optimal 3D Angular Resolution for Low-Degree Graphs David Eppstein 1 Maarten Löffler
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 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 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 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 informationStar and convex regular polyhedra by Origami.
Star and convex regular polyhedra by Origami. Build polyhedra by Origami.] Marcel Morales Alice Morales 2009 E D I T I O N M O R A L E S Polyhedron by Origami I) Table of convex regular Polyhedra... 4
More information(Refer Slide Time: 01.26)
Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 27 Pigeonhole Principle In the next few lectures
More informationCacti with minimum, second-minimum, and third-minimum Kirchhoff indices
MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 47-58 (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang
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 Breadth-first search (BFS) 4 Applications
More informationEVERY DAY COUNTS CALENDAR MATH 2005 correlated to
EVERY DAY COUNTS CALENDAR MATH 2005 correlated to Illinois Mathematics Assessment Framework Grades 3-5 E D U C A T I O N G R O U P A Houghton Mifflin Company YOUR ILLINOIS GREAT SOURCE REPRESENTATIVES:
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 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 informationThis class deals with the fundamental structural features of proteins, which one can understand from the structure of amino acids, and how they are
This class deals with the fundamental structural features of proteins, which one can understand from the structure of amino acids, and how they are put together. 1 A more detailed view of a single protein
More informationThe degree of a polynomial function is equal to the highest exponent found on the independent variables.
DETAILED SOLUTIONS AND CONCEPTS - POLYNOMIAL FUNCTIONS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions and Comments to ingrid.stewart@csn.edu. Thank you! PLEASE NOTE
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 informationSimple Graphs Degrees, Isomorphism, Paths
Mathematics for Computer Science MIT 6.042J/18.062J Simple Graphs Degrees, Isomorphism, Types of Graphs Simple Graph this week Multi-Graph Directed Graph next week Albert R Meyer, March 10, 2010 lec 6W.1
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É CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
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 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 degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
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 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 informationGrade 3 FCAT 2.0 Mathematics Sample Answers
Grade FCAT 2.0 Mathematics Sample Answers This booklet contains the answers to the FCAT 2.0 Mathematics sample questions, as well as explanations for the answers. It also gives the Next Generation Sunshine
More informationof surface, 569-571, 576-577, 578-581 of triangle, 548 Associative Property of addition, 12, 331 of multiplication, 18, 433
Absolute Value and arithmetic, 730-733 defined, 730 Acute angle, 477 Acute triangle, 497 Addend, 12 Addition associative property of, (see Commutative Property) carrying in, 11, 92 commutative property
More informationSelected practice exam solutions (part 5, item 2) (MAT 360)
Selected practice exam solutions (part 5, item ) (MAT 360) Harder 8,91,9,94(smaller should be replaced by greater )95,103,109,140,160,(178,179,180,181 this is really one problem),188,193,194,195 8. On
More information3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max
SOLUTION OF LINEAR PROGRAMMING PROBLEMS THEOREM 1 If a linear programming problem has a solution, then it must occur at a vertex, or corner point, of the feasible set, S, associated with the problem. Furthermore,
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationSolving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
More informationIllinois State Standards Alignments Grades Three through Eleven
Illinois State Standards Alignments Grades Three through Eleven Trademark of Renaissance Learning, Inc., and its subsidiaries, registered, common law, or pending registration in the United States and other
More informationFinal Review Geometry A Fall Semester
Final Review Geometry Fall Semester Multiple Response Identify one or more choices that best complete the statement or answer the question. 1. Which graph shows a triangle and its reflection image over
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 informationCameron Liebler line classes
Cameron Liebler line classes Alexander Gavrilyuk Krasovsky Institute of Mathematics and Mechanics, (Yekaterinburg, Russia) based on joint work with Ivan Mogilnykh, Institute of Mathematics (Novosibirsk,
More informationList the 3 main types of subatomic particles and indicate the mass and electrical charge of each.
Basic Chemistry Why do we study chemistry in a biology course? All living organisms are composed of chemicals. To understand life, we must understand the structure, function, and properties of the chemicals
More information2. If C is the midpoint of AB and B is the midpoint of AE, can you say that the measure of AC is 1/4 the measure of AE?
MATH 206 - Midterm Exam 2 Practice Exam Solutions 1. Show two rays in the same plane that intersect at more than one point. Rays AB and BA intersect at all points from A to B. 2. If C is the midpoint of
More informationLine Segments, Rays, and Lines
HOME LINK Line Segments, Rays, and Lines Family Note Help your child match each name below with the correct drawing of a line, ray, or line segment. Then observe as your child uses a straightedge to draw
More informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationGeometry 1. Unit 3: Perpendicular and Parallel Lines
Geometry 1 Unit 3: Perpendicular and Parallel Lines Geometry 1 Unit 3 3.1 Lines and Angles Lines and Angles Parallel Lines Parallel lines are lines that are coplanar and do not intersect. Some examples
More informationALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite
ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,
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 informationCommon Core Unit Summary Grades 6 to 8
Common Core Unit Summary Grades 6 to 8 Grade 8: Unit 1: Congruence and Similarity- 8G1-8G5 rotations reflections and translations,( RRT=congruence) understand congruence of 2 d figures after RRT Dilations
More informationGrade 3 Core Standard III Assessment
Grade 3 Core Standard III Assessment Geometry and Measurement Name: Date: 3.3.1 Identify right angles in two-dimensional shapes and determine if angles are greater than or less than a right angle (obtuse
More information39 Symmetry of Plane Figures
39 Symmetry of Plane Figures In this section, we are interested in the symmetric properties of plane figures. By a symmetry of a plane figure we mean a motion of the plane that moves the figure so that
More information3D shapes. Level A. 1. Which of the following is a 3-D shape? A) Cylinder B) Octagon C) Kite. 2. What is another name for 3-D shapes?
Level A 1. Which of the following is a 3-D shape? A) Cylinder B) Octagon C) Kite 2. What is another name for 3-D shapes? A) Polygon B) Polyhedron C) Point 3. A 3-D shape has four sides and a triangular
More informationPROTEINS THE PEPTIDE BOND. The peptide bond, shown above enclosed in the blue curves, generates the basic structural unit for proteins.
Ca 2+ The contents of this module were developed under grant award # P116B-001338 from the Fund for the Improvement of Postsecondary Education (FIPSE), United States Department of Education. However, those
More information8. Matchings and Factors
8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,
More information12-1 Representations of Three-Dimensional Figures
Connect the dots on the isometric dot paper to represent the edges of the solid. Shade the tops of 12-1 Representations of Three-Dimensional Figures Use isometric dot paper to sketch each prism. 1. triangular
More informationGeometry Chapter 1. 1.1 Point (pt) 1.1 Coplanar (1.1) 1.1 Space (1.1) 1.2 Line Segment (seg) 1.2 Measure of a Segment
Geometry Chapter 1 Section Term 1.1 Point (pt) Definition A location. It is drawn as a dot, and named with a capital letter. It has no shape or size. undefined term 1.1 Line A line is made up of points
More informationUnit 3: Circles and Volume
Unit 3: Circles and Volume This unit investigates the properties of circles and addresses finding the volume of solids. Properties of circles are used to solve problems involving arcs, angles, sectors,
More informationTools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR-2010-10
Tools for parsimonious edge-colouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR-2010-10 Tools for parsimonious edge-colouring of graphs
More informationShape Dictionary YR to Y6
Shape Dictionary YR to Y6 Guidance Notes The terms in this dictionary are taken from the booklet Mathematical Vocabulary produced by the National Numeracy Strategy. Children need to understand and use
More informationDNA Worksheet BIOL 1107L DNA
Worksheet BIOL 1107L Name Day/Time Refer to Chapter 5 and Chapter 16 (Figs. 16.5, 16.7, 16.8 and figure embedded in text on p. 310) in your textbook, Biology, 9th Ed, for information on and its structure
More informationAnswer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )
1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the
More informationOn the crossing number of K m,n
On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known
More informationPERIMETER AND AREA. In this unit, we will develop and apply the formulas for the perimeter and area of various two-dimensional figures.
PERIMETER AND AREA In this unit, we will develop and apply the formulas for the perimeter and area of various two-dimensional figures. Perimeter Perimeter The perimeter of a polygon, denoted by P, is the
More informationA NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS
A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS PAWE L PRA LAT Abstract. In this note we consider the on-line Ramsey numbers R(P n, P m ) for paths. Using a high performance computing clusters,
More informationTopological Treatment of Platonic, Archimedean, and Related Polyhedra
Forum Geometricorum Volume 15 (015) 43 51. FORUM GEOM ISSN 1534-1178 Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic
More information1. A student followed the given steps below to complete a construction. Which type of construction is best represented by the steps given above?
1. A student followed the given steps below to complete a construction. Step 1: Place the compass on one endpoint of the line segment. Step 2: Extend the compass from the chosen endpoint so that the width
More informationGEOMETRY CONCEPT MAP. Suggested Sequence:
CONCEPT MAP GEOMETRY August 2011 Suggested Sequence: 1. Tools of Geometry 2. Reasoning and Proof 3. Parallel and Perpendicular Lines 4. Congruent Triangles 5. Relationships Within Triangles 6. Polygons
More informationOn end degrees and infinite cycles in locally finite graphs
On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel
More informationCOMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationRemoving Even Crossings
EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationChapter 4.1 Parallel Lines and Planes
Chapter 4.1 Parallel Lines and Planes Expand on our definition of parallel lines Introduce the idea of parallel planes. What do we recall about parallel lines? In geometry, we have to be concerned about
More informationHOLES 5.1. INTRODUCTION
HOLES 5.1. INTRODUCTION One of the major open problems in the field of art gallery theorems is to establish a theorem for polygons with holes. A polygon with holes is a polygon P enclosing several other
More informationHow To Solve The Social Studies Test
Math 00 Homework #0 Solutions. Section.: ab. For each map below, determine the number of southerly paths from point to point. Solution: We just have to use the same process as we did in building Pascal
More information+ 4θ 4. We want to minimize this function, and we know that local minima occur when the derivative equals zero. Then consider
Math Xb Applications of Trig Derivatives 1. A woman at point A on the shore of a circular lake with radius 2 miles wants to arrive at the point C diametrically opposite A on the other side of the lake
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationRegular Augmentations of Planar Graphs with Low Degree
Regular Augmentations of Planar Graphs with Low Degree Bachelor Thesis of Huyen Chau Nguyen At the Department of Informatics Institute of Theoretical Computer Science Reviewers: Advisors: Prof. Dr. Dorothea
More informationA Sublinear Bipartiteness Tester for Bounded Degree Graphs
A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite
More informationFactoring Patterns in the Gaussian Plane
Factoring Patterns in the Gaussian Plane Steve Phelps Introduction This paper describes discoveries made at the Park City Mathematics Institute, 00, as well as some proofs. Before the summer I understood
More informationWhich two rectangles fit together, without overlapping, to make a square?
SHAPE level 4 questions 1. Here are six rectangles on a grid. A B C D E F Which two rectangles fit together, without overlapping, to make a square?... and... International School of Madrid 1 2. Emily has
More informationUPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE
UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs
More informationAlgebra Geometry Glossary. 90 angle
lgebra Geometry Glossary 1) acute angle an angle less than 90 acute angle 90 angle 2) acute triangle a triangle where all angles are less than 90 3) adjacent angles angles that share a common leg Example:
More informationBasic Geometry Review For Trigonometry Students. 16 June 2010 Ventura College Mathematics Department 1
Basic Geometry Review For Trigonometry Students 16 June 2010 Ventura College Mathematics Department 1 Undefined Geometric Terms Point A Line AB Plane ABC 16 June 2010 Ventura College Mathematics Department
More informationFor the circle above, EOB is a central angle. So is DOE. arc. The (degree) measure of ù DE is the measure of DOE.
efinition: circle is the set of all points in a plane that are equidistant from a given point called the center of the circle. We use the symbol to represent a circle. The a line segment from the center
More informationGeometry Module 4 Unit 2 Practice Exam
Name: Class: Date: ID: A Geometry Module 4 Unit 2 Practice Exam Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Which diagram shows the most useful positioning
More informationTopology-based network security
Topology-based network security Tiit Pikma Supervised by Vitaly Skachek Research Seminar in Cryptography University of Tartu, Spring 2013 1 Introduction In both wired and wireless networks, there is the
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More information56 questions (multiple choice, check all that apply, and fill in the blank) The exam is worth 224 points.
6.1.1 Review: Semester Review Study Sheet Geometry Core Sem 2 (S2495808) Semester Exam Preparation Look back at the unit quizzes and diagnostics. Use the unit quizzes and diagnostics to determine which
More information