Some Polygonal Sum Labeling of Paths

Size: px
Start display at page:

Download "Some Polygonal Sum Labeling of Paths"

Transcription

1 Volume 6 No.5, January 03 Some Polygonal Sum Labeling of Paths S.Murugesan Associate Professor CBM college Coimbatore-60 D.Jayaraman Associate Professor CBM College Coimbatore- 60 J.Shiama Assistant Professor CMS College of Science and Commerce Coimbatore- 609 ABSTRACT A (p,q) graph G is said to admit a polygonal sum labeling if its vertices can be labeled by non -negative integers such that the induced edge labels obtained by the sum of the labels of end vertices are the first q polygonal A graph G which admits a polygonal sum labeling is called a polygonal sum graph. In this paper we prove that the paths admit pentagonal, hexagonal, heptagonal, octagonal, nonagonal and decagonal sum This work is a nice composition of graph theory and combinatorial number theory.. INTRODUCTION The graphs considered here are finite, connected, undirected and simple. The vertex set and the edge set of a graph G are denoted by V(G) and E(G) respectively. For various graph theoretic notations and terminology we follow Harary [] and for number theory we follow Burton []. We will give the brief summary of definitions which are useful for the present investigations. Definition-.: If the vertices of the graph are assigned values subject to certain conditions it is known as graph A dynamic survey on graph labeling is regularly updated by Gallian [3] and it is published by Electronic Journal of Combinatorics. Vast amount of literature is available on different types of graph labeling and more than 000 research papers have been published so far in last four decades. Most interesting labeling problems have three important ingredients. A set of numbers from which vertex labels are chosen; A rule that assigns a value to each edge; A condition that these values must satisfy. The present work is aimed to discuss one such labeling known as polygonal sum Definition-.: Polygonal numbers are just the number of vertices in a figure formed by a certain polygon. The first number in any group of polygonal numbers is always one or a point. The second number is equal to the number of vertices of the polygon. The third number is made by extending two of the sides of the polygon from the second polygonal number, completing the larger polygon and placing vertices and other points wherever necessary. The third polygonal number is found by adding all the vertices and points in the resulting figure. Triangular Numbers Square Numbers Definition-.3: Pentagonal numbers are numbers that create a pentagon. In other words:, 5,,, 35, 5, 70, 9, 7, 5, If the n th pentagonal number is denoted by A n, then A n = n(3n-). Definition-.: A pentagonal sum labeling of a graph G is one to one function f: V(G) N (where N is the set of all non- negative integers) that induces a bijection f + : E(G) {A, A,..., A q } of the edges of G defined by f + (uv) = f(u) + f(v) for every e= uv є E(G). The graph which admits such labeling is called a pentagonal sum graph. 30

2 Volume 6 No.5, January 03 Example-.5: A pentagonal sum graph In the n th heptagonal number is denoted by C n, then C n = n(5n-3). Definition-.0: A heptagonal sum labeling of a graph G f + : E(G) {C, C,..., C q } of the edges of G defined by admits such labeling is called a heptagonal sum graph. Example-.: Definition-.6: Hexagonal numbers are numbers that create a hexagon. In other words:, 6, 5, 8, 5, 66, 9, 0, 53, 90, 3, 76, If the n th- hexagonal number is denoted by B n, then B n = n(n- ). Definition-.7:A hexagonal sum labeling of a graph G is a one-to-one function f:v(g) N that induces a bijection f + : E(G) {B, B,..., B q } of the edges of G defined by f + (uv) = f(u) + f(v) for every e= uv є E(G). The graph which admits such labeling is called a hexagonal sum graph. Example-.8: Definition-.: Octagonal numbers are numbers that create an octagon. In other words:, 8,, 0, 65, 96, 33,76,5,80,3,08,8,560, 65, 736, 833, 936, 05, 60, 8, 08, 5, In the n th octagonal number is denoted by D n, then D n = n(3n- ). Definition-.3: An octagonal sum labeling of a graph G f + : E(G) {D, D,..., D q } of the edges of G defined by admits such labeling is called an octagonal sum graph. Example-.: Definition-.9: Heptagonal numbers are numbers that create a heptagon. In other words:, 7, 8, 3, 55, 8,, 8, 89, 35, 86, 3, 03, 69, 50, 66, 697,... Definition-.5: Nonagonal numbers are numbers that create a nonagon. In other words:, 9,,6, 75,, 5, 0, 6, 35, 396, 7, 559, 65, 750, 856, 969, 089, 6, 350, 9, 639, 79,956, 5, 30, 8, 67, 87, 3075,

3 Volume 6 No.5, January 03. MAIN RESULTS In the n th nonagonal number is denoted by E n, then E n = n(7n-5). Definition-.6: A nonagonal sum labeling of a graph G f + : E(G) {E, E,..., E q } of the edges of G defined by admits such labeling is called a nonagonal sum graph. Example-.7: Definition-.8: Decagonal numbers are numbers that create a decagon. In other words:,0,7,5,85,6,75,3,97,370,5,50,637,7, 855,976,05,,387,50,70,870,07,3, 5,66,835,305,377,350,375,000,57, 5,795,5076,5365,566,... Here we prove that the paths P n admit pentagonal, hexagonal, heptagonal, octagonal, nonagonal and decagonal sum Theorem.: The path P n admits pentagonal sum Proof: Let P n : u u u 3... u n be the path and v i= u i u i+ ( i n-) be the edges. For i=,,,n, define f(u i ) = ( i )(3i ) = i (3i ) We will prove that the induced edge labels obtained by the sum of the labels of end vertices are the first n- pentagonal f(u i )+ f(u i+ ) = ( i )(3i ) ( i )[3( i ) ] ( i )(3i ) ( i )(3i ) ) = A i ) f(u i )+ f(u i+ ) ) ( i)(3i ) = A i In the n th decagonal number is denoted by F n, then F n = n(n- 3). Definition-.9: A decagonal sum labeling of a graph G f + : E(G) {F, F,..., F q } of the edges of G defined by admits such labeling is called a decagonal sum graph. Example-.0: Thus the induced edge labels are the first n- pentagonal Hence P n admits pentagonal sum Example.: The pentagonal sum labeling of P is shown in the following figure. Theorem-.3:The path P n admits hexagonal sum Proof: Let P n : u u u 3... u n be the path and v i = u i u i+ ( i n-) be the edges. For i=,,,n, define f(u i ) = ( i )(i ) 3

4 Volume 6 No.5, January 03 = ( i)(i f(u i )+ f(u i+ ) = ( i )(i ) ( i )(i ) Thus the induced edge labels are the first n- heptagonal Hence P n admits heptagonal sum Example.6: The heptagonal sum labeling of P 9 is shown below ( i )(i ) = B i ( i )(i ) f(u i )+ f(u i+ ) ( i )(i ( i)(i ) =B i Thus the induced edge labels are the first n- hexagonal Hence P n admits hexagonal sum Example.: The hexagonal sum labeling of P 0 is shown below. Theorem-.5: The path P n admits heptagonal sum Proof: Let P n : u u u 3... u n be the path and v i= u i u i+ ( i n-) be the edges. For i=,,,n, define ( )(5i 8 f(u i ) = ( i )(5i = i ) f(u i )+ f(u i+ ) = ( i )(5i ( i )(5i ( i )(5i = C i ( i )(5i f(u i )+ f(u i+ ) ( i )(5i 8) ( i)(5i ) =C i Theorem-.7:The path P n admits octagonal sum Proof: Let P n : u u u 3... u n be the path and v i = u i u i+ ( i n-) be the edges. For i=,,,n, define ( )(3i 5 f(u i ) = ( i )(3i ) = i ) f(u i )+ f(u i+ ) = ( i )(3i ) ( i )(3i ) ) = D i ) f(u i )+ f(u i+ ) 5) ( i)(3i ) =D i Thus the induced edge labels are the first n- octagonal Hence P n admits octagonal sum Example.8: The octagonal sum labeling of P is shown below. Theorem-.9: The path P n admits nonagonal sum Proof: Let P n : u u u 3... u n be the path and v i= u i u i+ ( i n-) be the edges. For i=,,,n, define f(u i ) = ( i )(7i 5) 33

5 Volume 6 No.5, January 03 = ( i )(7i ) f(u i )+ f(u i+ ) = ( i )(7i 5) ( i )(7i 5) ( i )(7i 5) = E i ( i )(7i 5) f(u i )+f(u i+ ) ( i )(7i ) ( i)(7i ) =E i Thus the induced edge labels are the first n- nonagonal Hence P n admits nonagonal sum Example.0: The nonagonal sum labeling of P is shown below f(u i )+ f(u i+ ) = ( i )(i ( i )(i ( i )(i = F i f(u i )+ f(u i+ ) ( i )(i 7) ( i)(i ) ( i )(i 3) =F i Thus the induced edge labels are the first n- decagonal Hence P n admits decagonal sum Example.: The decagonal sum labeling of P 0 is shown below Theorem-.:The path P n admits decagonal sum Proof: Let P n : u u u 3... u n be the path and v i= u i u i+ ( i n-) be the edges. For i=,,,n, define f(u i ) = ( i )(i = ( i )(i 7) Conclusion The polygonal sum labeling can be verified for many other graphs. Also some more polygonal sum labeling can be investigated. REFERENCES [] Frank Harary, Graph theory, Narosa Publishing House- (00). [] D.M.Burton, Elementary number theory, Brown publishers, Second edition(990) [3] J A Gallian, A dynamic survey of graph labeling, The Electronic journal of Combinatorics, 7(00) # DS6 [] S.K.Vaidya, U.M.Prajapatti and P.L.Vihol, some Important Results on Triangular sum graphs, Applied Mathematical Sciences, Vol.3,009,no.36,

UNIT H1 Angles and Symmetry Activities

UNIT H1 Angles and Symmetry Activities UNIT H1 Angles and Symmetry Activities Activities H1.1 Lines of Symmetry H1.2 Rotational and Line Symmetry H1.3 Symmetry of Regular Polygons H1.4 Interior Angles in Polygons Notes and Solutions (1 page)

More information

On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

More information

Target To know the properties of a rectangle

Target To know the properties of a rectangle Target To know the properties of a rectangle (1) A rectangle is a 3-D shape. (2) A rectangle is the same as an oblong. (3) A rectangle is a quadrilateral. (4) Rectangles have four equal sides. (5) Rectangles

More information

P. Jeyanthi and N. Angel Benseera

P. Jeyanthi and N. Angel Benseera Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

More information

Which shapes make floor tilings?

Which shapes make floor tilings? Which shapes make floor tilings? Suppose you are trying to tile your bathroom floor. You are allowed to pick only one shape and size of tile. The tile has to be a regular polygon (meaning all the same

More information

Labeling outerplanar graphs with maximum degree three

Labeling 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 information

11.3 Curves, Polygons and Symmetry

11.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 information

6.2 Permutations continued

6.2 Permutations continued 6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

More information

BOUNDARY EDGE DOMINATION IN GRAPHS

BOUNDARY EDGE DOMINATION IN GRAPHS BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

More information

Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours

Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours Essential Question: LESSON 4 FINITE ARITHMETIC SERIES AND RELATIONSHIP TO QUADRATIC

More information

Topological Treatment of Platonic, Archimedean, and Related Polyhedra

Topological 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 information

3D 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?

3D 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 information

Angles that are between parallel lines, but on opposite sides of a transversal.

Angles 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 information

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH 31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

More information

Geometry Progress Ladder

Geometry Progress Ladder Geometry Progress Ladder Maths Makes Sense Foundation End-of-year objectives page 2 Maths Makes Sense 1 2 End-of-block objectives page 3 Maths Makes Sense 3 4 End-of-block objectives page 4 Maths Makes

More information

Chapter 7. Permutation Groups

Chapter 7. Permutation Groups Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

More information

Chapter 8 Geometry We will discuss following concepts in this chapter.

Chapter 8 Geometry We will discuss following concepts in this chapter. Mat College Mathematics Updated on Nov 5, 009 Chapter 8 Geometry We will discuss following concepts in this chapter. Two Dimensional Geometry: Straight lines (parallel and perpendicular), Rays, Angles

More information

Investigating Relationships of Area and Perimeter in Similar Polygons

Investigating Relationships of Area and Perimeter in Similar Polygons Investigating Relationships of Area and Perimeter in Similar Polygons Lesson Summary: This lesson investigates the relationships between the area and perimeter of similar polygons using geometry software.

More information

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 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 information

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL 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 information

Shape Dictionary YR to Y6

Shape 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 information

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

More information

SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH

SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH CHAPTER 3 SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like B-radius

More information

Geometry of Minerals

Geometry of Minerals Geometry of Minerals Objectives Students will connect geometry and science Students will study 2 and 3 dimensional shapes Students will recognize numerical relationships and write algebraic expressions

More information

Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity. 7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,

More information

Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1

Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1 GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept

More information

SCORE SETS IN ORIENTED GRAPHS

SCORE SETS IN ORIENTED GRAPHS Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

More information

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010 CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

More information

Simple Graphs Degrees, Isomorphism, Paths

Simple 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 information

Handout #1: Mathematical Reasoning

Handout #1: Mathematical Reasoning Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

More information

S on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =

S on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P = Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped

More information

Every tree contains a large induced subgraph with all degrees odd

Every 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 information

Geometry 8-1 Angles of Polygons

Geometry 8-1 Angles of Polygons . Sum of Measures of Interior ngles Geometry 8-1 ngles of Polygons 1. Interior angles - The sum of the measures of the angles of each polygon can be found by adding the measures of the angles of a triangle.

More information

Network Flow I. Lecture 16. 16.1 Overview. 16.2 The Network Flow Problem

Network Flow I. Lecture 16. 16.1 Overview. 16.2 The Network Flow Problem Lecture 6 Network Flow I 6. Overview In these next two lectures we are going to talk about an important algorithmic problem called the Network Flow Problem. Network flow is important because it can be

More information

Lecture 16 : Relations and Functions DRAFT

Lecture 16 : Relations and Functions DRAFT CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

More information

Total colorings of planar graphs with small maximum degree

Total colorings of planar graphs with small maximum degree Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong

More information

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

More information

SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

More information

56 questions (multiple choice, check all that apply, and fill in the blank) The exam is worth 224 points.

56 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

YILUN SHANG. e λi. i=1

YILUN SHANG. e λi. i=1 LOWER BOUNDS FOR THE ESTRADA INDEX OF GRAPHS YILUN SHANG Abstract. Let G be a graph with n vertices and λ 1,λ,...,λ n be its eigenvalues. The Estrada index of G is defined as EE(G = n eλ i. In this paper,

More information

Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li

Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li Computer Algorithms NP-Complete Problems NP-completeness The quest for efficient algorithms is about finding clever ways to bypass the process of exhaustive search, using clues from the input in order

More information

Cycles in a Graph Whose Lengths Differ by One or Two

Cycles 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 information

PERIMETER 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 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 information

Mathematical Induction. Lecture 10-11

Mathematical Induction. Lecture 10-11 Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

More information

Why? A central concept in Computer Science. Algorithms are ubiquitous.

Why? A central concept in Computer Science. Algorithms are ubiquitous. Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

More information

A MEASURE OF GLOBAL EFFICIENCY IN NETWORKS. Aysun Aytac 1, Betul Atay 2. Faculty of Science Ege University 35100, Bornova, Izmir, TURKEY

A MEASURE OF GLOBAL EFFICIENCY IN NETWORKS. Aysun Aytac 1, Betul Atay 2. Faculty of Science Ege University 35100, Bornova, Izmir, TURKEY International Journal of Pure and Applied Mathematics Volume 03 No. 05, 6-70 ISSN: 3-8080 (printed version); ISSN: 34-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/0.73/ijpam.v03i.5

More information

Class One: Degree Sequences

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 information

Shapes & Designs Notes

Shapes & Designs Notes Problem 1.1 Definitions: regular polygons - polygons in which all the side lengths and angles have the same measure edge - also referred to as the side of a figure tiling - covering a flat surface with

More information

ISAT Mathematics Performance Definitions Grade 4

ISAT Mathematics Performance Definitions Grade 4 ISAT Mathematics Performance Definitions Grade 4 EXCEEDS STANDARDS Fourth-grade students whose measured performance exceeds standards are able to identify, read, write, represent, and model whole numbers

More information

Exploring Geometric Figures Using Cabri Geometry II

Exploring Geometric Figures Using Cabri Geometry II Exploring Geometric Figures Using Cabri Geometry II Regular Polygons Developed by: Charles Bannister. Chambly County High School Linda Carre.. Chambly County High School Manon Charlebois Vaudreuil Catholic

More information

Grade 7 & 8 Math Circles Circles, Circles, Circles March 19/20, 2013

Grade 7 & 8 Math Circles Circles, Circles, Circles March 19/20, 2013 Faculty of Mathematics Waterloo, Ontario N2L 3G Introduction Grade 7 & 8 Math Circles Circles, Circles, Circles March 9/20, 203 The circle is a very important shape. In fact of all shapes, the circle is

More information

Shortcut sets for plane Euclidean networks (Extended abstract) 1

Shortcut sets for plane Euclidean networks (Extended abstract) 1 Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,

More information

Mathematics for Algorithm and System Analysis

Mathematics for Algorithm and System Analysis Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface

More information

Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

More information

8. Matchings and Factors

8. 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 information

Tools 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. 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 information

Connectivity and cuts

Connectivity 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 information

An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

More information

PUZZLES WITH POLYHEDRA AND PERMUTATION GROUPS

PUZZLES WITH POLYHEDRA AND PERMUTATION GROUPS PUZZLES WITH POLYHEDRA AND PERMUTATION GROUPS JORGE REZENDE. Introduction Consider a polyhedron. For example, a platonic, an arquemidean, or a dual of an arquemidean polyhedron. Construct flat polygonal

More information

Discrete Mathematics Problems

Discrete Mathematics Problems Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

More information

Applications for Triangles

Applications for Triangles Not drawn to scale Applications for Triangles 1. 36 in. 40 in. 33 in. 1188 in. 2 69 in. 2 138 in. 2 1440 in. 2 2. 188 in. 2 278 in. 2 322 in. 2 none of these Find the area of a parallelogram with the given

More information

Lecture 7: NP-Complete Problems

Lecture 7: NP-Complete Problems IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit

More information

Finding and counting given length cycles

Finding 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 information

Section 7.1 Solving Right Triangles

Section 7.1 Solving Right Triangles Section 7.1 Solving Right Triangles Note that a calculator will be needed for most of the problems we will do in class. Test problems will involve angles for which no calculator is needed (e.g., 30, 45,

More information

Intermediate Math Circles October 10, 2012 Geometry I: Angles

Intermediate Math Circles October 10, 2012 Geometry I: Angles Intermediate Math Circles October 10, 2012 Geometry I: Angles Over the next four weeks, we will look at several geometry topics. Some of the topics may be familiar to you while others, for most of you,

More information

GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

More information

Tenacity and rupture degree of permutation graphs of complete bipartite graphs

Tenacity and rupture degree of permutation graphs of complete bipartite graphs Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China

More information

Degree Hypergroupoids Associated with Hypergraphs

Degree Hypergroupoids Associated with Hypergraphs Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

More information

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

More information

TU e. Advanced Algorithms: experimentation project. The problem: load balancing with bounded look-ahead. Input: integer m 2: number of machines

TU e. Advanced Algorithms: experimentation project. The problem: load balancing with bounded look-ahead. Input: integer m 2: number of machines The problem: load balancing with bounded look-ahead Input: integer m 2: number of machines integer k 0: the look-ahead numbers t 1,..., t n : the job sizes Problem: assign jobs to machines machine to which

More information

All 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) 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 information

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM

SPERNER 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 information

Mathematical Induction. Mary Barnes Sue Gordon

Mathematical Induction. Mary Barnes Sue Gordon Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

More information

On the Relationship between Classes P and NP

On the Relationship between Classes P and NP Journal of Computer Science 8 (7): 1036-1040, 2012 ISSN 1549-3636 2012 Science Publications On the Relationship between Classes P and NP Anatoly D. Plotnikov Department of Computer Systems and Networks,

More information

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

More information

Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set. Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

More information

SA B 1 p where is the slant height of the pyramid. V 1 3 Bh. 3D Solids Pyramids and Cones. Surface Area and Volume of a Pyramid

SA B 1 p where is the slant height of the pyramid. V 1 3 Bh. 3D Solids Pyramids and Cones. Surface Area and Volume of a Pyramid Accelerated AAG 3D Solids Pyramids and Cones Name & Date Surface Area and Volume of a Pyramid The surface area of a regular pyramid is given by the formula SA B 1 p where is the slant height of the pyramid.

More information

Integrated Math Concepts Module 10. Properties of Polygons. Second Edition. Integrated Math Concepts. Solve Problems. Organize. Analyze. Model.

Integrated Math Concepts Module 10. Properties of Polygons. Second Edition. Integrated Math Concepts. Solve Problems. Organize. Analyze. Model. Solve Problems Analyze Organize Reason Integrated Math Concepts Model Measure Compute Communicate Integrated Math Concepts Module 1 Properties of Polygons Second Edition National PASS Center 26 National

More information

Area of a triangle: The area of a triangle can be found with the following formula: You can see why this works with the following diagrams:

Area of a triangle: The area of a triangle can be found with the following formula: You can see why this works with the following diagrams: Area Review Area of a triangle: The area of a triangle can be found with the following formula: 1 A 2 bh or A bh 2 You can see why this works with the following diagrams: h h b b Solve: Find the area of

More information

. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9 Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

More information

On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

More information

Graph Theory Problems and Solutions

Graph 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 information

Graphical degree sequences and realizations

Graphical 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 information

Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

More information

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete 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 information

FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem

FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem Opuscula Mathematica Vol. 32 No. 4 2012 http://dx.doi.org/10.7494/opmath.2012.32.4.751 FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS Mateusz Nikodem Abstract. We develop the problem of fault-tolerant

More information

of surface, 569-571, 576-577, 578-581 of triangle, 548 Associative Property of addition, 12, 331 of multiplication, 18, 433

of 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 information

arxiv:0909.4913v2 [math.ho] 4 Nov 2009

arxiv:0909.4913v2 [math.ho] 4 Nov 2009 IRRATIONALITY FROM THE BOOK STEVEN J. MILLER AND DAVID MONTAGUE arxiv:0909.4913v2 [math.ho] 4 Nov 2009 A right of passage to theoretical mathematics is often a proof of the irrationality of 2, or at least

More information

So let us begin our quest to find the holy grail of real analysis.

So let us begin our quest to find the holy grail of real analysis. 1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

More information

The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

More information

Non-Separable Detachments of Graphs

Non-Separable Detachments of Graphs Egerváry Research Group on Combinatorial Optimization Technical reports TR-2001-12. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

More information

The Open University s repository of research publications and other research outputs

The 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 information

Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion. Ernie Croot. February 3, 2010 Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

More information

Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there - 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

More information

PROPERTIES OF N-SIDED REGULAR POLYGONS

PROPERTIES OF N-SIDED REGULAR POLYGONS PROPERTIES OF N-SIDED REGULAR POLYGONS When students are first exposed to regular polygons in middle school, they learn their properties by looking at individual examples such as the equilateral triangles(n=3),

More information

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

More information

Single machine parallel batch scheduling with unbounded capacity

Single machine parallel batch scheduling with unbounded capacity Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University

More information

arxiv:1203.1525v1 [math.co] 7 Mar 2012

arxiv:1203.1525v1 [math.co] 7 Mar 2012 Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined

More information

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

More information

A 2-factor in which each cycle has long length in claw-free graphs

A 2-factor in which each cycle has long length in claw-free graphs A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

More information