# MATHEMATICAL THOUGHT AND PRACTICE. Chapter 7: The Mathematics of Networks The Cost of Being Connected

Save this PDF as:

Size: px
Start display at page:

Download "MATHEMATICAL THOUGHT AND PRACTICE. Chapter 7: The Mathematics of Networks The Cost of Being Connected"

## Transcription

1 MATHEMATICAL THOUGHT AND PRACTICE Chapter 7: The Mathematics of Networks The Cost of Being Connected

2

3

4 Network A network is a graph that is connected. In this context the term is most commonly used when the graph models a real-life network.

5 Network Twitter Network flowingdata.com The vertices of a network (nodes, terminals) are objects transmitting stations, servers, places, cell phones, people... The edges of a network (links) indicate connections among objects wires, cables, roads, internet connections, social connections...

6 Optimal Network Social Networking Collage The design of an optimal network involves two basic goals: 1. To make sure that all the vertices connect to the network and 2. To minimize the total cost of the network.

7 The Amazonian Cable Network The telephone company must lay fiber-optic lines along the roads between towns.

8 The Amazonian Cable Network Vertices represent the towns, edges represent existing roads, and weights represent costs in millions of dollars to lay the cables along that road.

9 Language of Graphs 1. The network must be a subgraph of (edges come from) the original graph. 2. The network must span (include all vertices) the original graph. 3. The network must be minimal (total weight of network should be as small as possible).

10 Minimal Network No Circuits Circuits cannot be part of minimal networks. The edge XY would be a redundant link of the network.

11 Formal Definitions images.worldgallery.co.uk A network is a connected graph. A weighted network has weighted edges. A network with no circuits is called a tree. A spanning tree is a subgraph that connects all the vertices and has no circuits. The spanning tree with least total weight is called a minimum spanning tree (MST).

12 Clicker Quicker Sticker

13 Networks, Trees, and Spanning Trees The six graphs on the following slides all have the same set of vertices (A through L). Let s imagine that these vertices represent computer labs at a university, and that the edges are Ethernet connections between pairs of labs.

14 Networks, Trees, and Spanning Trees No network graph is disconnected. Network with circuits

15 Networks, Trees, and Spanning Trees No network partial tree Network, spanning tree, no redundancies

16 Properties of Trees A tree is special because it s barely connected. This means: 1. For any two vertices, there is one and only one path joining X to Y. 2. Every edge of a tree is a bridge. 3. Among all networks with N vertices, a tree has the fewest number of edges.

17 Connect the Dots (and Stop) Start with eight isolated vertices. Create a network connecting the vertices by adding edges, one at a time. Create any network you want. Bridges are good and circuits are bad. (Imagine each bridge gives you \$10 reward, but each you pay \$10.)

18 Connect the Dots (and Stop) For M = 7, the graph becomes connected. Each of these networks is a tree, and thus each of the seven edges is a bridge. Stop here and you will come out \$70 richer.

19 Connect the Dots (and Stop) As M increases, the number of circuits goes up and bridges goes down.

20 Tree Properties

21 Tree Properties

22 Clicker Quicker Sticker

23 Clicker Quicker Sticker

24 Spanning Trees An American Haunting In the case of a network with positive redundancy, there are many trees within the network that connect its vertices these are the spanning trees of the network.

25 Counting Spanning Trees Redundancy of the network is R = M (N 1)= 1. So to find a spanning tree we will have to discard one edge.

26 The network has three different spanning trees.

27 Counting Spanning Trees The network has M = 9 edges and N = 8 vertices. The redundancy of the network is R = 2, so to find a spanning tree we will have to discard two edges getting rid of circuits.

28 Counting Spanning Trees

29 Counting Spanning Trees This network has M = 9 edges and N = 8 vertices. Here the circuits share a common edge CG. Determining which pairs of edges can be excluded in this case is a bit more complicated.

30 Clicker Quicker Sticker

31 Clicker Quicker Sticker

32 Find Minimum Spanning Trees (MST) Vertices represent computer labs, and edges are potential Ethernet connections. The weights are in thousands of dollars. The weighted network has a redundancy of R = 3 (M = 14 and N = 12).

33 Find Minimum Spanning Trees (MST) Is this spanning tree minimal? Can we be sure? And if so, what assurances do we have that this strategy will work in all graphs? These are the questions we will answer next.

34 Kruskal s Algorithm

35 The Amazonian Cable Network What is the optimal fiberoptic cable network connecting the seven towns shown?

36 The Amazonian Cable Network Find the MST. Step 1 Choose the cheapest link: GF (\$42 mill.) Step 2 The next cheapest link is BD (\$45 million) Step 3 The next cheapest link is AD at \$49 million. Step 4 Next, AB and DG tie, but we rule out AB since it would create a circuit.

37 The Amazonian Cable Network Step 5 The next cheapest link is CD. Step 6 The next cheapest is BC, but that would create a circuit. The next is CF, but that creates another circuit. The next CE. Finished, with a cost of \$299 million.

38 Kruskal s Algorithm personales.upv.es As algorithms go, Kruskal s algorithm is as good as it gets: easy and efficient. As we increase the number of vertices and edges, the work grows proportionally. Since Kruskal s algorithm is optimal, always finding the MST, we have solved our conundrum!

39 Clicker Quicker Sticker

40 Clicker Quicker Sticker

41 Clicker Quicker Sticker

42 Shortest Network MSTs represent the optimal way to connect existing vertices and edges of the network. But what if were free to create new vertices and links outside the original network?

43 The Outback Cable Network The towns are connected by unpaved straight roads. What is the cheapest fiberoptic network connecting the three towns?

44 The Outback Cable Network The MST gives us a ceiling of1000 miles. The T-network is shorter, 933 miles, using triangles. The Y-network is shortest at 866 miles.

45 Shortest Network

46 Shortest Network

47 Shortest Network

48 Third Trans-Pacific Cable Network hawaiivacations.transamglobal.com In 1989, a consortium of telephone companies completed the Third Trans-Pacific Cable (TPC-3) line, a network of submarine fiber-optic lines linking Japan and Guam to the United States (via Hawaii).

49 Third Trans-Pacific Cable Network Submarine cable costs \$50 to \$70 K per mile, so we need the shortest network. An interior junction point in the triangle? Where?

50 Third Trans-Pacific Cable Network The theoretical length of the shortest network is 5180 miles, but the uneven ocean floor adds as much as 10%, and the actual length is 5690 miles.

51 Kruskal s Algorithm From these examples, we might assume that the shortest network connecting three points joins at a Steiner point S inside the triangle. This is only true when we have a Steiner point inside the triangle.

52 A High-Speed Rail Network

53 A High-Speed Rail Network General property of triangles: For any triangle ABC and interior point S, angle ASC must be bigger than angle ABC. For ASC to be 120º, ABC must be less than 120º.

54 A High-Speed Rail Network Our angle is about 155º; so no Steiner junction point exists inside the triangle. Without a Steiner junction point, how do we find the shortest network?

55 A High-Speed Rail Network In this situation the shortest network consists of the two shortest sides of the triangle, which happens to be the minimum spanning tree.

56 Shortest Network

57 Shortest Network

58 Clicker Quicker Sticker

59 Clicker Quicker Sticker

60 Clicker Quicker Sticker

61 Clicker Quicker Sticker

62 Clicker Quicker Sticker

63 Clicker Quicker Sticker

64 Torricelli s Construction In the 1600s Italian Evangelista Torricelli discovered a remarkably simple and elegant method for locating a Steiner point inside a triangle, using a straightedge and a compass.

65

66

67 Four-City Networks Imagine four cities (A, B, C, and D) that need to be connected. What does the optimal network look like?

68 Four-City Networks If we don t want to create any interior junction points in the network, then the answer is a minimum spanning tree, such as the one shown. The length of the MST is 1500 miles.

69 Four-City Networks If interior junction points are allowed, an X-junction located at O, the center of the square, would shorten the length to approximately 1414 miles.

70 Four-City Networks Even better is a network with two Steiner points: Two such networks exist (one is a rotated version of the other) having the same length about 1366 miles, which is the shortest possible.

71 Four-City Networks This time we change the dimensions of the rectangle, as shown.

72 Four-City Networks We know that the MST is 1000 miles long.

73 Four-City Networks For the shortest network, an obvious candidate would be a network with two interior Steiner junction points. There are two such networks shown.

74 Four-City Networks The length of the network on the left is approximately 993 miles, while the length of the network on the right is approximately 920 miles, the shortest possible network!

75 Four-City Networks This time, imagine that the cities are located at the vertices of a skinny trapezoid, as shown. The minimum spanning tree (in red) is 600 miles long.

76 Four-City Networks What about the shortest network? We should look for two interior Steiner junction points; however, since angles at A and B are greater than 120º, no Steiner points exist inside the trapezoid.

77 Four-City Networks If not Steiner points, how about X-, T-, or Y- junctions? In reality, the only possible interior junction points in a shortest network are Steiner points.

78 Shortest Networks Since we also know that the shortest network without interior junction points is the minimum spanning tree, then the MST must be the shortest network whenever no interior Steiner points exist.

79 Four-City Networks This time, our cities sit as shown. The MST is shown and its length is 1000 miles.

80 Four-City Networks The shortest network is either the MST or one with interior Steiner points. It s impossible to have two interior Steiner points, but there are three possible networks with a single interior Steiner point:

81 Four-City Networks miles miles This last network is the shortest in our list and thus the shortest network connecting, the four cities miles

82 Shortest Network

83 Shortest Network Algorithm simonnemichelle.files.wordpress.com 1. List all Steiner trees. 2. Using Kruskal s algorithm, find the minimum spanning tree. 3. Compare all trees. The shorter is the shortest network.

84 Shortest Network Algorithm Impractical farm1.static.flickr.com With as few as 10 points, we might have to compute over a million possible Steiner trees; with 20 cities, the number of possible Steiner trees is in the billions. Optimal but inefficient

85 Approximate Solutions Sophisticated approximate algorithms solve problems with hundreds of points and efficiently produce short networks less than 1% off the shortest network. Even simple Kruskal s algorithm can be used as a reasonably good approximate. For any set of points, the MST is never much longer than the shortest network: 13.4% longer at most, but usually 3% or less.

86 Homework Online homework for Chapter 7 Paper homework for Chapter 7 Online quiz for Chapter 7 Group projects meet with me this week

### Networks! Topics in Contemporary Mathematics! MA 103! Summer II, 2013!

1! Networks! Topics in Contemporary Mathematics! MA 103! Summer II, 2013! 2! Content Trees Spanning Trees Kruskal s Algorithm The Shortest Network Connecting Three Points Shortest Networks for Four or

### Chapter 6: Graph Theory

Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance.

### Lecture Notes on Spanning Trees

Lecture Notes on Spanning Trees 15-122: Principles of Imperative Computation Frank Pfenning Lecture 26 April 26, 2011 1 Introduction In this lecture we introduce graphs. Graphs provide a uniform model

### Graph Algorithms using Map-Reduce

Graph Algorithms using Map-Reduce Graphs are ubiquitous in modern society. Some examples: The hyperlink structure of the web 1/7 Graph Algorithms using Map-Reduce Graphs are ubiquitous in modern society.

### MGF 1107 CH 15 LECTURE NOTES Denson. Section 15.1

1 Section 15.1 Consider the house plan below. This graph represents the house. Consider the mail route below. This graph represents the mail route. 2 Definitions 1. Graph a structure that describes relationships.

### Lesson 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

### The Mathematics of Networks (Chapter 7)

The Mathematics of Networks (Chapter 7) We have studied how to visit all the edges of a graph (via an Euler path or circuit) and how to visit all the vertices (via a Hamilton circuit). The Mathematics

### IE 680 Special Topics in Production Systems: Networks, Routing and Logistics*

IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti

### Grade 7/8 Math Circles Greek Constructions - Solutions October 6/7, 2015

Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Greek Constructions - Solutions October 6/7, 2015 Mathematics Without Numbers The

### GRAPH THEORY and APPLICATIONS. Trees

GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.

### 0810ge. Geometry Regents Exam 0810

0810ge 1 In the diagram below, ABC XYZ. 3 In the diagram below, the vertices of DEF are the midpoints of the sides of equilateral triangle ABC, and the perimeter of ABC is 36 cm. Which two statements identify

### Winter 2016 Math 213 Final Exam. Points Possible. Subtotal 100. Total 100

Winter 2016 Math 213 Final Exam Name Instructions: Show ALL work. Simplify wherever possible. Clearly indicate your final answer. Problem Number Points Possible Score 1 25 2 25 3 25 4 25 Subtotal 100 Extra

### UK Junior Mathematical Olympiad 2016

UK Junior Mathematical Olympiad 206 Organised by The United Kingdom Mathematics Trust Tuesday 4th June 206 RULES AND GUIDELINES : READ THESE INSTRUCTIONS CAREFULLY BEFORE STARTING. Time allowed: 2 hours.

### Connection and costs distribution problems

MaMaEuSch Management Mathematics for European Schools http://www.mathematik.unikl.de/ mamaeusch Connection and costs distribution problems Federico Perea Justo Puerto MaMaEuSch Management Mathematics for

### Chapter 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.

### On Geometric Proofs: Base angles of an isosceles trapezoid are equal Perpendicular bisectors of a triangle meet at a common point

On Geometric Proofs: Base angles of an isosceles trapezoid are equal Perpendicular bisectors of a triangle meet at a common point Before demonstrating the above proofs, we should review what sort of geometric

### Math 443/543 Graph Theory Notes 4: Connector Problems

Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we

### The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Thursday, January 24, 2013 9:15 a.m. to 12:15 p.m.

GEOMETRY The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY Thursday, January 24, 2013 9:15 a.m. to 12:15 p.m., only Student Name: School Name: The possession or use of any

### *1. Derive formulas for the area of right triangles and parallelograms by comparing with the area of rectangles.

Students: 1. Students understand and compute volumes and areas of simple objects. *1. Derive formulas for the area of right triangles and parallelograms by comparing with the area of rectangles. Review

### Three-Dimensional Figures or Space Figures. Rectangular Prism Cylinder Cone Sphere. Two-Dimensional Figures or Plane Figures

SHAPE NAMES Three-Dimensional Figures or Space Figures Rectangular Prism Cylinder Cone Sphere Two-Dimensional Figures or Plane Figures Square Rectangle Triangle Circle Name each shape. [triangle] [cone]

### Geometry - Semester 2. Mrs. Day-Blattner 1/20/2016

Geometry - Semester 2 Mrs. Day-Blattner 1/20/2016 Agenda 1/20/2016 1) 20 Question Quiz - 20 minutes 2) Jan 15 homework - self-corrections 3) Spot check sheet Thales Theorem - add to your response 4) Finding

### Solutions 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.

### Minimum Spanning Trees

Minimum Spanning Trees Algorithms and 18.304 Presentation Outline 1 Graph Terminology Minimum Spanning Trees 2 3 Outline Graph Terminology Minimum Spanning Trees 1 Graph Terminology Minimum Spanning Trees

### The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Student Name:

GEOMETRY The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY Wednesday, August 18, 2010 8:30 to 11:30 a.m., only Student Name: School Name: Print your name and the name of

### Quadrilaterals Properties of a parallelogram, a rectangle, a rhombus, a square, and a trapezoid

Quadrilaterals Properties of a parallelogram, a rectangle, a rhombus, a square, and a trapezoid Grade level: 10 Prerequisite knowledge: Students have studied triangle congruences, perpendicular lines,

### 4 Week Modular Course in Geometry and Trigonometry Strand 1. Module 1

4 Week Modular Course in Geometry and Trigonometry Strand 1 Module 1 Theorems: A Discovery Approach Theorems are full of potential for surprise and delight. Every theorem can be taught by considering the

### Geometry Regents Review

Name: Class: Date: Geometry Regents Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. If MNP VWX and PM is the shortest side of MNP, what is the shortest

### The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Wednesday, January 29, 2014 9:15 a.m. to 12:15 p.m.

GEOMETRY The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY Wednesday, January 29, 2014 9:15 a.m. to 12:15 p.m., only Student Name: School Name: The possession or use of any

### CSPs: Arc Consistency

CSPs: Arc Consistency CPSC 322 CSPs 3 Textbook 4.5 CSPs: Arc Consistency CPSC 322 CSPs 3, Slide 1 Lecture Overview 1 Recap 2 Consistency 3 Arc Consistency CSPs: Arc Consistency CPSC 322 CSPs 3, Slide 2

### Basic 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

### A. 32 cu ft B. 49 cu ft C. 57 cu ft D. 1,145 cu ft. F. 96 sq in. G. 136 sq in. H. 192 sq in. J. 272 sq in. 5 in

7.5 The student will a) describe volume and surface area of cylinders; b) solve practical problems involving the volume and surface area of rectangular prisms and cylinders; and c) describe how changing

### Chapter There are non-isomorphic rooted trees with four vertices. Ans: 4.

Use the following to answer questions 1-26: In the questions below fill in the blanks. Chapter 10 1. If T is a tree with 999 vertices, then T has edges. 998. 2. There are non-isomorphic trees with four

### *1. Understand the concept of a constant number like pi. Know the formula for the circumference and area of a circle.

Students: 1. Students deepen their understanding of measurement of plane and solid shapes and use this understanding to solve problems. *1. Understand the concept of a constant number like pi. Know the

### Unit 2, Activity 2, One-half Inch Grid

Unit 2, Activity 2, One-half Inch Grid Blackline Masters, Mathematics, Grade 8 Page 2-1 Unit 2, Activity 2, Shapes Cut these yellow shapes out for each pair of students prior to class. The labels for each

### SPECIAL PRODUCTS AND FACTORS

CHAPTER 442 11 CHAPTER TABLE OF CONTENTS 11-1 Factors and Factoring 11-2 Common Monomial Factors 11-3 The Square of a Monomial 11-4 Multiplying the Sum and the Difference of Two Terms 11-5 Factoring the

### Session 5 Dissections and Proof

Key Terms for This Session Session 5 Dissections and Proof Previously Introduced midline parallelogram quadrilateral rectangle side-angle-side (SAS) congruence square trapezoid vertex New in This Session

### Motion Graphs. It is said that a picture is worth a thousand words. The same can be said for a graph.

Motion Graphs It is said that a picture is worth a thousand words. The same can be said for a graph. Once you learn to read the graphs of the motion of objects, you can tell at a glance if the object in

### Scaling 10Gb/s Clustering at Wire-Speed

Scaling 10Gb/s Clustering at Wire-Speed InfiniBand offers cost-effective wire-speed scaling with deterministic performance Mellanox Technologies Inc. 2900 Stender Way, Santa Clara, CA 95054 Tel: 408-970-3400

### Mathematics 2540 Paper 5540H/3H

Edexcel GCSE Mathematics 540 Paper 5540H/3H November 008 Mark Scheme 1 (a) 3bc 1 B1 for 3bc (accept 3cb or bc3 or cb3 or 3 b c oe, but 7bc 4bc gets no marks) (b) x + 5y B for x+5y (accept x+y5 or x + 5

### Assessment For The California Mathematics Standards Grade 3

Introduction: Summary of Goals GRADE THREE By the end of grade three, students deepen their understanding of place value and their understanding of and skill with addition, subtraction, multiplication,

### SUPPLEMENT TO CHAPTER 6 MINIMUM SPANNING-TREE PROBLEMS

S h 6- SUPPLMNT TO HPTR 6 MINIMUM SPNNIN-TR PROLMS hapter 6 focuses on network optimization problems. These are problems that can be described in terms of a complete network that has both nodes and links

### Social 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

### UNIVERSITY OF WISCONSIN SYSTEM

Name UNIVERSITY OF WISCONSIN SYSTEM MATHEMATICS PRACTICE EXAM Check us out at our website: http://www.testing.wisc.edu/center.html GENERAL INSTRUCTIONS: You will have 90 minutes to complete the mathematics

### 7-3 Parallel and Perpendicular Lines

Learn to identify parallel, perpendicular, and skew lines, and angles formed by a transversal. 7-3 Parallel Insert Lesson and Perpendicular Title Here Lines Vocabulary perpendicular lines parallel lines

### CSE 123: Computer Networks

Total Points = 28 CSE 123: Computer Networks Homework 2 Solutions Out: 4/20, Due: 4/27 Problems 1. High Frequency Trading [5 pts] Companies like Goldman Sachs put a high value on using very low latency

### Figure 1.0 The two key forces in rowing

1.0 Moving the boat In order to understand this, at first it is easiest to think of the boat and the rower as a single object. (Of course, in reality when you row, your body and the oar both move relative

### My name is Erin Catto and I m a programmer at Blizzard Entertainment.

Hello everyone! Thank you for coming to my tutorial today. My name is Erin Catto and I m a programmer at Blizzard Entertainment. Today I m going to talk about computing distance. 1 Suppose we have a pair

### Grade 7 & 8 Math Circles. Mathematical Games - Solutions

Faculty of Mathematics Waterloo, Ontario N2L 3G1 Grade 7 & 8 Math Circles November 19/20/21, 2013 Mathematical Games - Solutions 1. Classic Nim and Variations (a) If the Nim Game started with 40 matchsticks,

### Week 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

### Solution Guide for Chapter 6: The Geometry of Right Triangles

Solution Guide for Chapter 6: The Geometry of Right Triangles 6. THE THEOREM OF PYTHAGORAS E-. Another demonstration: (a) Each triangle has area ( ). ab, so the sum of the areas of the triangles is 4 ab

### The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Tuesday, January 26, 2016 1:15 to 4:15 p.m., only.

GEOMETRY The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY Tuesday, January 26, 2016 1:15 to 4:15 p.m., only Student Name: School Name: The possession or use of any communications

### Perimeter and Area of Geometric Figures on the Coordinate Plane

Perimeter and Area of Geometric Figures on the Coordinate Plane There are more than 00 national flags in the world. One of the largest is the flag of Brazil flown in Three Powers Plaza in Brasilia. This

### BASIC 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

### Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C

### From Euclid to Spigotry #7b Cubic Equations and Origami

Last modified: August 26, 2011 From Euclid to Spigotry #7b Cubic Equations and Origami Reading Bold, pages 10-17. Lecture topics 1. Menelaus proof of a lovely theorem I learned this theorem from Wendell

### Graph. Consider a graph, G in Fig Then the vertex V and edge E can be represented as:

Graph A graph G consist of 1. Set of vertices V (called nodes), (V = {v1, v2, v3, v4...}) and 2. Set of edges E (i.e., E {e1, e2, e3...cm} A graph can be represents as G = (V, E), where V is a finite and

### Chinese postman problem

PTR hinese postman problem Learning objectives fter studying this chapter, you should be able to: understand the hinese postman problem apply an algorithm to solve the problem understand the importance

### Geometry 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

### MA.7.G.4.2 Predict the results of transformations and draw transformed figures with and without the coordinate plane.

MA.7.G.4.2 Predict the results of transformations and draw transformed figures with and without the coordinate plane. Symmetry When you can fold a figure in half, with both sides congruent, the fold line

### Maximum / Minimum Problems

171 CHAPTER 6 Maximum / Minimum Problems Methods for solving practical maximum or minimum problems will be examined by examples. Example Question: The material for the square base of a rectangular box

### 1 Basic Definitions and Concepts in Graph Theory

CME 305: Discrete Mathematics and Algorithms 1 Basic Definitions and Concepts in Graph Theory A graph G(V, E) is a set V of vertices and a set E of edges. In an undirected graph, an edge is an unordered

### DRAFT ONLY. Advanced roofing. Part 2. Tradie profile Chris Nance Carpenter. Chapter 2 Advanced roofing Chapter 3 Roof trusses

Part 2 Advanced roofing Chapter 2 Advanced roofing Chapter 3 Roof trusses Tradie profile Chris Nance Carpenter Complex roofing is probably the best test of a carpenter s skill. On a normal roof it can

### The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Wednesday, June 19, :15 a.m. to 12:15 p.m., only.

GEOMETRY The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY Wednesday, June 19, 2013 9:15 a.m. to 12:15 p.m., only Student Name: School Name: The possession or use of any

### Congruence. Set 5: Bisectors, Medians, and Altitudes Instruction. Student Activities Overview and Answer Key

Instruction Goal: To provide opportunities for students to develop concepts and skills related to identifying and constructing angle bisectors, perpendicular bisectors, medians, altitudes, incenters, circumcenters,

### GEOMETRY (Common Core)

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY (Common Core) Tuesday, June 2, 2015 1:15 to 4:15 p.m. MODEL RESPONSE SET Table of Contents Question 25...................

### SOLVED PROBLEMS REVIEW COORDINATE GEOMETRY. 2.1 Use the slopes, distances, line equations to verify your guesses

CHAPTER SOLVED PROBLEMS REVIEW COORDINATE GEOMETRY For the review sessions, I will try to post some of the solved homework since I find that at this age both taking notes and proofs are still a burgeoning

### Higher Geometry Problems

Higher Geometry Problems ( Look up Eucidean Geometry on Wikipedia, and write down the English translation given of each of the first four postulates of Euclid. Rewrite each postulate as a clear statement

### Geometry 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

### Lesson 1.1 Building Blocks of Geometry

Lesson 1.1 Building Blocks of Geometry For Exercises 1 7, complete each statement. S 3 cm. 1. The midpoint of Q is. N S Q 2. NQ. 3. nother name for NS is. 4. S is the of SQ. 5. is the midpoint of. 6. NS.

### Objectives. The Role of Redundancy in a Switched Network. Layer 2 Loops. Broadcast Storms. More problems with Layer 2 loops

ITE I Chapter 6 2006 Cisco Systems, Inc. All rights reserved. Cisco Public 1 Objectives Implement Spanning Tree Protocols LAN Switching and Wireless Chapter 5 Explain the role of redundancy in a converged

### Lesson 1. The Basic Building Blocks of Geometry

Lesson 1 The Basic Building Blocks of Geometry 1 2 Overview Geometry is the study of shapes, patterns, relationships, and measurements. There are many different kinds of shapes in geometry including trapezoids,

### Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

### The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Tuesday, August 13, 2013 8:30 to 11:30 a.m., only.

GEOMETRY The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY Tuesday, August 13, 2013 8:30 to 11:30 a.m., only Student Name: School Name: The possession or use of any communications

Name: Class: Date: Quadrilaterals Unit Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. ( points) In which polygon does the sum of the measures of

### Homework Sheet Use the digits 2, 3, 4, 8 to complete the calculation. 17 Draw a dot diagram to show why 9 is a square number

Homework Sheet Calculate 5 3 0 A triangle has vertices at (0,0), (, 4) and (5,0). Plot the vertices and draw the triangle. carrying) Simplify 638 59 6a + 0a + 3a 3 Complete this calculation (show carrying)

### 1. An isosceles trapezoid does not have perpendicular diagonals, and a rectangle and a rhombus are both parallelograms.

Quadrilaterals - Answers 1. A 2. C 3. A 4. C 5. C 6. B 7. B 8. B 9. B 10. C 11. D 12. B 13. A 14. C 15. D Quadrilaterals - Explanations 1. An isosceles trapezoid does not have perpendicular diagonals,

### Similar Polygons. Copy both triangles onto tracing paper. Measure and record the sides of each triangle. Cut out both triangles.

-7 Similar Polygons MAIN IDEA Identify similar polygons and find missing measures of similar polygons. New Vocabulary polygon similar corresponding parts congruent scale factor Math Online glencoe.com

### INFORMATION 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

### Family Letters. Assessment Management. Playing Fraction Of

Formula for the Area of a Parallelogram Objectives To review the properties of parallelograms; and to guide the development and use of a formula for the area of a parallelogram. www.everydaymathonline.com

About the Tutorial This tutorial offers a brief introduction to the fundamentals of graph theory. Written in a reader-friendly style, it covers the types of graphs, their properties, trees, graph traversability,

### (Refer Slide Time: 1:48)

Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 29 Multiplexer Based Design (Refer Slide Time: 1:48) Yesterday we

### The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Thursday, August 13, 2009 8:30 to 11:30 a.m., only.

GEOMETRY The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY Thursday, August 13, 2009 8:30 to 11:30 a.m., only Student Name: School Name: Print your name and the name of your

### CHAPTER 1. Minimum connectors

PTR Minimum connectors Learning objectives fter studying this chapter, you should be able to: understand the significance of a minimum spanning tree apply Kruskal s algorithm to a network apply Prim s

### Graph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis

Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.0, steen@cs.vu.nl Chapter 06: Network analysis Version: April 8, 04 / 3 Contents Chapter

### MESA Bridge Design. Basic Engineering Task:

1 asic Engineering Task: We have to transfer a load A to supports, using ¼ square balsa, and there has to be clearance under the bridge for vehicles to pass underneath. A 1 2 Loads: Loads in beams can

### Benchmark Assessment Test 2005 Math Grade 5 Test 1 Interpretive Guide

Benchmark Assessment Test 2005 Math Grade 5 Test 1 Interpretive Guide STRAND A MAA122 Compare relative size and order of whole numbers, fractions, decimals and percents 1 2 Comparing common fractions with

### Wide Area Networks. Learning Objectives. LAN and WAN. School of Business Eastern Illinois University. (Week 11, Thursday 3/22/2007)

School of Business Eastern Illinois University Wide Area Networks (Week 11, Thursday 3/22/2007) Abdou Illia, Spring 2007 Learning Objectives 2 Distinguish between LAN and WAN Distinguish between Circuit

### 2. THE x-y PLANE 7 C7

2. THE x-y PLANE 2.1. The Real Line When we plot quantities on a graph we can plot not only integer values like 1, 2 and 3 but also fractions, like 3½ or 4¾. In fact we can, in principle, plot any real

### Similar Triangles. Triangles are similar if corresponding angles are equal.

Imagine you are having a picnic at the lake. You look out across the lake and see a sailboat off in the distance the sail is a tiny triangle to the naked eye. For a closer look, you pick up the binoculars

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

### PCB ROUTERS AND ROUTING METHODS

PCB ROUTERS AND ROUTING METHODS BY: LEE W. RITCHEY, SPEEDING EDGE, COPYRIGHT SPEEDING EDGE DECEMBER 1999 FOR PUBLICATION IN FEBRUARY ISSUE OF PC DESIGN MAGAZINE INTRODUCTION Routing of printed circuit

### LAN Topologies, Access methods

LAN Topologies, Access methods (Week 1, Wednesday 1/10/2007) Abdou Illia, Spring 2007 1 Learning Objectives Describe LAN topologies Describe major LAN access methods (Ethernet, Token ring, and FDDI) 2

### Chapter 3. Chapter 3 Opener. Section 3.1. Big Ideas Math Blue Worked-Out Solutions. Try It Yourself (p. 101) So, the value of x is 112.

Chapter 3 Opener Try It Yourself (p. 101) 1. The angles are vertical. x + 8 120 x 112 o, the value of x is 112. 2. The angles are adjacent. ( x ) + 3 + 43 90 x + 46 90 x 44 o, the value of x is 44. 3.

### / Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry 2.1 Steiner Tree Definition 2.1.1 In the Steiner Tree problem the input

### The London Independent Girls Schools Consortium. Mathematics Specimen Paper

Name: Present School:.. The London Independent Girls Schools Consortium Mathematics Specimen Paper Instructions: Time allowed: 1 hour 15 minutes Only use a pencil and a rubber. Do all your rough working

### Coordinate Coplanar Distance Formula Midpoint Formula

G.(2) Coordinate and transformational geometry. The student uses the process skills to understand the connections between algebra and geometry and uses the oneand two-dimensional coordinate systems to

### Development of FIDO - A Network Design Tool for Fibre Cable Layout

Development of FIDO - A Network Design Tool for Fibre Cable Layout Andrew J Mason Andy B Philpott Operations Research Group University of Auckland New Zealand a.mason@auckland.ac.nz a.philpott@auckland.ac.nz

### Computer and Network Security

Computer and Network Security Dr. Arjan Durresi Louisiana State University Baton Rouge, LA 70810 Durresi@csc.LSU.Edu These slides are available at: http://www.csc.lsu.edu/~durresi/csc4601_07/ Louisiana