MA 2053-Graph Theory

Research Project I

Group 07 N.M. De Mel D.A.P.P. Dodangoda P.H.T. Imesh M.S.Mahanama T.Vinojan 110099T 110141R 110228P 110346B 110599C

Department of Computer Science & Engineering Date: 30-07-2013

Definition The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color[1]. Question - Part a) Problems arise if two departments with wireless access points (WAPs) within 70 m of each other operate on the same frequency. Use the data below to determine the fewest number of frequencies needed and how to assign these frequencies to departments. Department Math (Ma) Sociology(So) Physics (Ph) Psychology (Ps) History (Hi) English (En) Economics (Ec) Chemistry (Ch) Is within 70 meters of departments: Physics, Psychology, Chemistry, Sociology History, English, Economics, Math, Psychology, Chemistry Math, Chemistry Math, Chemistry, Sociology, Economics Sociology, English Sociology, Economics, History Sociology, English, Psychology Sociology, Psychology, Math, Physics

Solution To find the solution, a graph is drawn such that its vertices represent the departments. Since there arises problems when two departments with WAPs within 70 m of each other operate on the same frequency, the vertices representing the departments that are within 70m are connected by edges as shown below.

Then a greedy algorithm is used to colour the graph with minimum number of colours such that no two adjacent vertices have the same colour. The algorithm used for colouring the graph is shown in a flow chart and the sequence of colouring is also graphically represented next page. When colouring the graph, the colours are numbered in the used order.

(a) First the vertex (A) with highest number of edges is coloured with colour 1.

(b) Next the uncoloured vertex (B) adjacent to vertex A which has the next highest number of edges is selected.

(c) The vertex B is coloured with the lowestnumbered color that has not been used on any previously-colored vertices adjacent to B. (If all previously-used colors appear on vertices adjacent to B, a new color is introduced and numbered.)

(d) The above steps from the step (b) are repeated for all the adjacent vertices of vertex A.

(e) Next follow the procedure from step (a) for all the uncoloured vertices.

The minimum number of colours required to colour the graph gives the fewest number of frequencies needed. Therefore according to the definition mentioned at the beginning, the chromatic number of the graph gives the solution for the question, as chromatic number is the minimum number of colours needed to colour the graph without having two adjacent vertices in same colour. The chromatic number of the graph = 4 Therefore the fewest number of frequencies needed for the departments such that there is no issue is 4.

Theorems and Definitions Definition - A complete graph is a graph in which each pair of graph vertices is connected by an edge [2]. Definition - A tournament is a directed graph obtained by choosing a direction for each edge in an undirected complete graph [3]. Definition - A directed graph is called a directed acyclic graph (or, DAG) if it does not contain any directed cycles [4]. Definition - The number of head endpoints adjacent to a node is called the in-degree of the node and the number of tail endpoints adjacent to a node is its out-degree [5]. Theorem 1 - If a tournament graph G determines a unique ranking, then G is a Directed Acyclic Graph [6] Proposition- A digraph has a topological order if and only if it is a DAG (Directed Acyclic Graph. [7] Question- Part b) Suppose the round robin stage of the next Asian Cricket Cup between Bangladesh, India, Pakistan, and Sri Lanka has the following results: SL defeats B; SL defeats P; SL defeats I; B defeats I; I defeats P; P defeats B. Using graph theory concepts explain how to rank the 4 teams from best to worst, or why it is not possible to do so. Explanation of the Problem Round robin stage is almost similar to a league tournament where every player or team competes against every other opponent. In graph theory, this corresponds to a complete graph. But in this case this should be considered as a tournament graph since the graph is directed. We encounter a cyclic winning phenomenon among India, Pakistan and Bangladesh. Therefore we looked into some theories and definitions relevant to directed cyclic graphs and directed acyclic graphs (DAG). Since the problem is focusing on ranking the competitors, in-degree and out-degree of each vertex should be calculated.

Solution to the Problem As explained above, results of a round robin stage can be represented using a tournament graph. The problem can be illustrated from a tournament graph as shown below (see figure2). The arrows are placed such that the head and the tail depict victory and defeat respectively.
Out degree+=1 In degree+=1

Figure 1 The orientation of a random arrow

Sri Lanka

India

Banglades h

Pakistan

Figure 2 The graph relevant to the scenario There can be several ways or algorithms in which we can rank the teams. Only the most general methods are described below Method 1 First, consider that number of victories is the only factor that counts for the rank of a specific team. The sum of out-degrees at a node represents the number of victories. Therefore we have to consider only the out-degrees of a node in order to rank the teams from best to worst.

Sri Lanka

India

Banglades h 1

Pakistan

Figure 3 Out degree of each node (marked in red)

This is the general algorithm used in practical situations. But this method does not solve problems of above type. This is due to the cycle (highlighted with grey) which hinges the DAG property of the graph. Method 2 The above algorithm can be modified to get a better algorithm, though not used much practically. First we can consider the in degree of each node. Then a modified out-degree can be calculated using the following formula or a similar one. Out-degree increment =
- In-degree of the corresponding arrow Total number of nodes

The advantage of this algorithm can be explained as follows. Consider a situation where 2 teams A and B have won and lost equal number of times. But there can be a situation where A has defeated the best teams and B has defeated the worst teams. If in case someone wanted to give a weight to each victory according to the reputation of the opponent, the above algorithm can be used. But this algorithm becomes too much complex in practical situations. Even this algorithm fails to solve our main problem due to the cyclic nature of the graph.

0
Sri Lanka

2
India

1.5

0.5

2
Banglades h 0.5

2
Pakistan

0.5

Figure 4 In-degree (purple) and out-degree (Red) In the given case, the in-degree and the out-degree of the three vertices are equal. Therefore the ranks of three teams become equal. Thus the above scenario cannot be ranked from best to worst. But the best team can be easily selected since Sri Lanka has an out-degree of 1.5 and all the rest 0.5 each.

Questions 1) An organization need to schedule committee meetings in a way that the employees who are in more than one committee do not get a conflict in meeting schedules. Find the fewest number of time slots needed for the meetings. Names of employees who are in more than one committee are mentioned below. Name Committees belonging to

Mr.K.D.C. Perera Mr. A. Athulathmudali Mrs.K.H.S.M. De Silva Mr. S.P. Mohan Mrs. P.D.A. Samarakoon Mr. L.E. Dayarathne Mr.J.C. Ahamad Mr. P.B. Arun

Executive, Finance, Marketing Marketing, Promotions and Sales Product / Program Development Marketing, Public Relations Finance, Promotions and Sales Executive, Product / Program Development Executive, Finance, Marketing Promotions and Sales, Public Relations

True/False Questions 1. We cannot use the Directed Acyclic Graph to find ranks of teams in a round robin tournament with tied games. 2. Every directed acyclic graph has exactly one topological ordering[8].

References [1] Wolfram Math World (2013). Chromatic Number [Online]. Available: http://mathworld.wolfram.com/ChromaticNumber.html [2] Weisstein, Eric W. Complete Graph. From MathWorld--A Wolfram Web Resource.http://mathworld.wolfram.com/CompleteGraph.html [3] Planet Math (2002, Oct 11). Tournament [online] . Available: http://planetmath.org/tournament [4] Weisstein, Eric W.(2013, July 27) Acyclic Digraph. Wolfram Math World [online]. Available: http://mathworld.wolfram.com/AcyclicDigraph.html [5] Wikipedia Enclyclopedia (2013, July 29). Directed Graph [online]. Available: https://en.wikipedia.org/wiki/Directed_graph [6] P. I. a. M. K. Professors Erik Demaine, Introduction to Algorithms (2011,April 13). [Online]. Available: http://courses.csail.mit.edu/6.006/oldquizzes/solutions/quiz2-s2011sol.pdf. [7] Robert Sedgewick and Kevin Wayne (2013, July 28) Directed Graphs[online]. Available http://algs4.cs.princeton.edu/42directed/ Additional Bibliography C. J. Casselgren, On Some Graph Coloring Problems (2011). [Online]. Available: http://umu.diva-portal.org/smash/get/diva2:413324/FULLTEXT01.pdf. Department of Mathematics , Princeton University. Graph Theory, Part 2 [Online]. Available: http://web.math.princeton.edu/math_alive/5/Notes2.pdf. Wolfram Math World (2013). Tournament [Online]. Available: http://mathworld.wolfram.com/Tournament.html N. Ailon, M. Charikar and A. Newman, Aggregating Inconsistent Information: Ranking and Clustering, Proc. of the 37th ACM STOC, Baltimore, ACM Press (2005). M. Kaykobad, Q.N.U. Ahmed, A.T.M. Khalid, R. Bakhtiar, A New Algorithm for ranking players of a round-robin tournament, Computers Ops. Res., Vol. 22, No. 2, pp. 221-226, 1995. Jan Kratochvil, Zsolt Tuza, Ranking of Directed Graphs (1997,November 07) Wikipedia (2013,June 19). Cycle (graph theory) [online] .Available: http://en.wikipedia.org/wiki/Cycle_(graph_theory)