Assigning tropical fish into tanks Presented by, Manisha Reddy Podduturi.

Slides:



Advertisements
Similar presentations
ROUND ROBIN SCHEDULING BY NAGA SAI HANUMAN.POTTI.
Advertisements

GRAPH COLORING AND ALLOTTING GATES FOR FLIGHTS PRESENTED BY AMUKTAMALYADA REDDY JAMBULA.
Agenda: Problem statement Graph Construction Relation to graph problem Special Property Problem solution References.
Train DEPOT PROBLEM USING PERMUTATION GRAPHS
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
GSM MOBILE PHONE NETWORKS AND GRAPH COLORING
The Instant Insanity Game
CISC220 Fall 2009 James Atlas Nov 13: Graphs, Line Intersections.
Exam Timetabling Problem using Graph Coloring
Graph Theory Ch.5. Coloring of Graphs 1 Chapter 5 Coloring of Graphs.
D1: Matchings.
ARCHEOLOGICAL SERIATION AND INTERVAL GRAPHS
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
INSTANT INSANITY PUZZLE By Patrick K. Asaba. INSTANT INSANITY PUZZLE The Instant Insanity puzzle is played with four cubes. Each face of the cube is colored.
2.4 – Linear Inequalities in One Variable
 T RIANGLE : A figure formed by three noncollinear points, connected by segments  Since two of the segments create a vertex, a triangle has three vertices.
CS 2813 Discrete Structures
9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.
Graph Coloring.
Polynomial Function A polynomial function of degree n, where n is a nonnegative integer, is a function defined by an expression of the form where.
Graph Coloring.
Graphs of Functions Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 The graph of a function y = f (x) is a set of.
4.6 Warm Up  Do #5-8 on pg (M1) Properties of Special Angles.
Graph Coloring Solution in a Deterministic Machine The deterministic solution to coloring problem uses these steps to assign colors to vertices: 1- Given.
 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.
Solving Compound Inequalities. Objective Today you will solve compound inequalities containing the word and, and graph their solution set. Today you will.
Computing the chromatic number for block intersection graphs of Latin squares Ed Sykes CS 721 project McMaster University, December 2004 Slide 1.
This line is called a transversal.
Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Planar Graphs Graph Coloring
Sec. 5.1: Planarity & Coloring
Graph.
GRAPH COLORING AND CLASSIFYING TROPICAL FISH By Vennam Chandrasekhar Reddy.
Distributing Chemical Compounds in Refrigerators using interval graphs
Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.
Lesson 3-5 Compound Inequalities Objective: To solve and graph inequalities containing and o o o or or.
Vertex Edge Graphs. What is a vertex-edge graph?  A collection of points, some of which are joined by line segments or curves  Examples:
1-5 Angle Relationships Students will learn how to identify and use special pairs of angles, namely, supplementary, complementary, and congruent (have.
Special Angle Pairs. Definitions Adjacent Angles: Angles that have a common ray or side and a common vertex, but points inside either one of the angles.
Graphs. Graph Definitions A graph G is denoted by G = (V, E) where  V is the set of vertices or nodes of the graph  E is the set of edges or arcs connecting.
Illustrations of Angle Pairs Geometry Mr. Killian.
Copyright © Cengage Learning. All rights reserved. Graphs; Equations of Lines; Functions; Variation 3.
A problem with train tracks and interval graphs PRESENTED BY MANVITHA NELLORE.
Maryam Pourebadi Kent State University April 2016.
Solve each inequality. Graph the solution set on a number line. 1. 3a + 3 < y + 2 > –22 3. –5m – 5 ≤ Ann has only $10 to spend on carnival.
Timetable Problem solving using Graph Coloring
Relations and Functions Objective: To use tables and graphs to represent relations and functions.
Objectives: Use properties of isosceles and equilateral triangles
Planar Graphs Hubert Chan (Chapter 9.7) [O2 Proof Techniques]
Graphing Linear Relations and Functions
TRANSFORMATIONS by Rose
Copyright © Cengage Learning. All rights reserved.
Basic Concepts Graphs For more notes and topics visit:
2.3 Graph Coloring Homework (MATH 310#3W):
Proof Techniques and Chessboard Problems
4.2 Vocabulary Remember…Transformation, Preimage, Image,
Graph Theory Graph Colorings.
Graph Theory Unit 2.
Compound Inequalities
6-1 Solving Systems by Graphing
Systems of equations.
Allocating time to Instructors
Applied Combinatorics, 4th ed. Alan Tucker
Insert Lesson Title Here
Indicator 10 Solving Inequalities.
Section Functions and Their Graphs
Intersection Method of Solution
Objectives Apply SSS to construct triangles and solve problems.
Digital Lesson Graphs of Functions.
Presentation transcript:

Assigning tropical fish into tanks Presented by, Manisha Reddy Podduturi

Plan for the talk: Tropical fish Problem Real-World problem Graph Construction Special property Problem solution

Tropical Fish Problem A tropical fish hobbyist had six different types of fish: Alphas, Betas, Cartas, Deltas, Epsalas and Fetas which shall be designated by A, B, C, D, E and F respectively. Real-World Problem: Because of Predator-prey relationships, water conditions and size only few fishes can be kept in the same tank. What is the least number of tanks needed to place all the fish?

Consider the following table shows which fish cannot be together: Type ABCDEF Cannot be with B, CA, C, DA, B, D, EC, E, FC, D, FD, E

Graph Construction:

Can you figure out what each vertex and each edge represent? Here, each vertex represents one of the type of fish and each edge connects vertices that are not compatible.

Interval Graph: The problem turns out to be interval graph problem. A B C D E F The interval graph shows the intersecting interval on a real line. It has one vertex for each interval in the family and an edge between every pair of vertices corresponding to intervals that intersect.

Special Property: Umbrella-Free Ordering For every interval graph there will be an umbrella free ordering. It states that, arranging the vertices in an order such that if there is an edge between two vertices then any edge that lies between the two vertices must be adjacent to the right vertex in the ordering. G has umbrella-free ordering if their exists an ordering of vertices of G v1, v2, …. vn such that a<b<c and a~c ⇒ b~c.

Umbrella-Free Ordering:

Problem Solution: Graph Coloring: It’s the simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices share the same colour. After coloring the graph using UFO: 1 Red Blue Green Red Blue Green

Problem Solution: What does each colour on the graph represent? How Chromatic number help to solve the problem?

Several different combinations of fish are possible depending on how the graph is coloured. Fish with vertices of the same colour go in to the same tank. The fewest number of tanks the tropical fish owner will need is three. Tank 1 Tank 2 Tank 3 Alphas and Deltas Fetas and Cartas Betas and Epsalas