1. GSM MOBILE PHONE NETWORKS AND GRAPH COLORING
By,
Manjeera Thogarcheti

2. OUTLINE Problem statement Graph construction Special properties
Relation to graph problem
Depicting the graph solution
references

3. PROBLEM STATEMENT
Mobile phone network area is divided into hexagonal regions or cells.
Communication tower connects the mobile phones.
Four frequency ranges 850, 900, 1800, bands.
Assign these frequencies in such a way that no two towers should have same frequency ranges.

4. GRAPH CONSTRUCTION (PLANAR GRAPH)
A graph can be drawn on a 2D or 3D plane without crossing the edges i.e., they intersect only at end points.

5. GRAPH CONSTRUCTION (DUAL GRAPH)
Convert the map into dual graph.
Put vertex inside each region.
If the boundaries are shared, then place an edge between the vertices.

7. SPECIAL PROPERTIES A dual of planar graph is a plane multi graph.
If G is a connected plane graph and if G′ is the dual of G then G is isomorphic to the dual of G′.
A finite graph is planar if and only if it does not have K5 or K3,3 as a minor

8. RELATION TO GRAPH PROBLEM
Restriction of four frequency ranges to place the cell towers.
Usage of graph coloring concept.
Chromatic number = 4
Greedy coloring algorithm.

9. DEPICTING THE GRAPH SOLUTION
Basic Greedy coloring algorithm
Let V be the number of vertices in the graph.
Color first vertex with first color.
Do the following for remaining V-1 vertices
Consider the currently picked vertex and color it with the lowest numbered color that has not been used on any previously colored vertices adjacent to it. If all previously used colors appear on vertices adjacent to v, assign a new color to it.

11. REFERENCES
plications_of_Graph_Coloring_in_Moder n_Computer_Science
/S /S pdf h
coloring-set-2-greedy-algorithm/

12. THANK YOU!!

13. ANY QUERIES??