Graph Coloring on Planar and Bipartite Graphs and Its Applications

Home , Bipartite graph

INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 9, ISSUE 01, JANUARY 2020 ISSN 2277-8616 Graph Coloring On Planar And Bipartite Graphs And Its Applications

A.Sushma, T. Nageswara Rao, B.V. Appa Rao, T.S.Rao

Abstract: In this paper we make speculations regarding graph coloring in planar graphs and bipartite graphs and further more about vertex coloring , edge coloring ,also a few outcomes are determined. The coloring issue has a countless applications in present day software engineering such as document move problem, making schedule of time table, information mining, networking. Here we focus around specific applications like finale test time tabling and aircraft scheduling

Index Terms: Graph, Chromatic number χ (G), Vertex coloring, Edge Coloring. ——————————  ——————————

1. INTRODUCTION In graph hypothesis , Graph Coloring is an extraordinary 2.4 Definition instance of graph marking it is a task of names generally A graph outlined in a plane is called a planar graph if no two termed "colors" to components of a graph subject to specific arcs intersect at any point except the common node. requirements. We put on few activities which follow up on graphs to give various graphs . In accumulation to put on 2.5 Definition graph operations , we shading the nodes of these gained If a graph G is drawn with crossing arcs then it is not graphs appropriately and furthermore we created color bundle compulsory that G is non planar graph . to color the nodes and arcs of graphs . Many of these graphs So we state that a graph G is non planar ,we have to are accurately attractive when drawn appropriately . Before contemplate all probable geometric illustrations of G. In all finishing this outline , we recollection some elementary these cases ,if the planarity ailment flops then the graph is non characterizations planar

2 PRELIMINARIES

2.1 Definition A graph G is a pair of (V, E) . The segments of V are the nodes of the graph G and the segments of E are its edges. A node v is incident with an arc e if v ϵ e. An arc {u, v} is regularly Composed as uv

2.2 Definition A graph G (V, E) is supposed to be a multigraph if G has self- loops and parallel edges.

2.6 Definition In the numerical area of graph hypothesis , a bipartite graph is 2.3 Definition a graph whose nodes can be partitioned into two individual The level of a node is the quantity of edges interfacing it is sets U1 and U2 with the end goal that each edge interfaces a known as degree of a node. node in U1 to one in U2 ————————————————  A.Sushma, M.sc student, Department of mathematics, Koneru Lakshmaiah Educational Foundation ,Vaddeswaram ,Guntur , Andhra Pradesh , India. E-mail: [email protected]  T.Nageswara Rao , Associate Professor, Department of mathematics, Koneru Lakshmaiah Educational Foundation, Vaddeswaram ,Guntur, Andhra Pradesh , India..  B.V.Appa Rao ,Professor & HOD, Department of mathematics, Koneru Lakshmaiah Educational Foundation, Vaddeswaram ,Guntur , Andhra Pradesh , India..  T.S.Rao, Associate Professor, Department of mathematics, Koneru Lakshmaiah Educational Foundation, Vaddeswaram ,Guntur , Andhra Pradesh , India.. (This information is optional; change it according to your need.)

3 GRAPH COLORING Graph coloring is one of the most important concepts in graph theory and is used in many real time applications in computer science . The proper coloring of a graph is the coloring of the vertices and edges with minimal number of colors such that no

3639 IJSTR©2020 www.ijstr.org INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 9, ISSUE 01, JANUARY 2020 ISSN 2277-8616 two vertices should have the same color. The minimum number of colors is called as the chromatic number and the graph is called properly colored graph .

Chromatic number 3

3.3 Definition:- The other surely understood and strongly contemplated type of graph shading what’s more node shading is the arc shading. The edge coloring of a graph G =

(V, E) is which doles out a shading to each arc, fulfilling the 3.1 Definition: A actual node shading problems for a graph G rule that no pair of arcs distributes a typical node have a is to paint entirely the nodes of the graph by various shades similar shading. basically like that whichever pair close by (holding an arc partner them) nodes of G have appointed various hues.

Vertex shading of graphs can represented as numerical model of different useful assignments. For instance the mathematics department is having difficulties scheduling courses A- G because of limited room availability. Make a graph with vertices A –G. Make an arc amongst nodes if the matching courses cannot be scheduled at the same time. The node shading problem is NP –complete. So many types of 3.4 Definition: The chromatic index of a graph G, symbolized node shading are there like circular node coloring, equitable as (G), is the lowest quantity of unlike colors necessary for node coloring , Acyclic – node coloring. appropriate arc shading of G

Chromatic index = 4

3.5 Theorem: For any graph G, Δ(G) ≤ (G) ≤ 2 Δ(G) -1 Proof: The noticeable lower bound of (G) is the supreme degree Δ(G) of any node in G. This is obviously, since the arcs occurrence one node must be inversely hued . It surveys Fig. 1. Proper Vertex coloring (Petersen graph) that Δ(G) ≤ (G),. The superior bound can be started by utilizing adjacency of arcs. Each arc is together to at most 3.2 Definition:- The chromatic number of a graph G, Δ(G) -1 additional arcs at each of its end points. Thus, symbolized as χ (G), is the lowest quantity of unlike colors 1 + (Δ (G) – 1) + (Δ (G) – 1) = 2 Δ(G) – 1 hues will necessary for appropriate node shading of G. endlessly enough for an appropriate arc shading of G.

3.6 Theorem: Let G be a graph with m arcs and let m*(G) be the dimension of a supreme matching. Then (G) ≥ ┌ ┐.

3.7 Theorem: The chromatic quantity of a planar graph is not greater than four. Proof: The theorem is communicated in the vertex-shading situation with the common assumptions, for example a colored plot in the plane or on a circle is symbolized by its dual (simple) graph G with shaded vertices. At the point When two nodes vk, vl ϵ G are associated by an edge vkvl (i.e. the countries on the map have a common line-shaped border), a(proper) shading requires particular hues c(vk) and c(vl).Without loss of generality the evidence can be limited to (planar) near-triangulations. A planar graph G is termed a near-triangulation if it is coupled, without circles , and each 4.2 Edge Coloring on Bipartite Graph:- inside area is (bounded by) a triangle. An area is a triangle if it The edge shading of a graph G = (V, E) is which doles out a is incident with exactly 3 edges. The outside area is bounded shading to each arc , fulfilling ailment that no two arcs allocate by the external cycle. A (full) triangulation is the unique a typical node have a similar shading . instance of a near-triangulation, when additionally the unending outside area is bounded by a triangle ( 3-cycle). It follows from Euler’s polyhedral method that a planar graph with n ≥ 3 vertices has all things considered 3n – 6 edges, and the triangulation is the edge-maximal graph. Every planar graph H can be generated from a triangulation G by eliminating edges and separated vertices, along these lines H ⊆ G holds. As elimination of edges decreases the quantity of limitations for shading , the chromatic number of H is not greater than the comparing number of G.

3.8 Definition: A graph is called bipartite if χ (G) ≤ 2. 3.9 Theorem: For any graph G, (G) ≥ Δ (G). 3.10 Theorem: Vizing’s Theorem: For any graph G, (G) equals either Δ (G) or Δ (G) +1. Fact : Most 3-regular graphs have edge chromatic number 3. 3.11 Definition: A 3-regular graph with edge chromatic number 4 is called a snark. 4.3 Vertex Coloring on Planar Graph :- In the above Fig.1. Petersen Graph is a snark. Node shading on planar graph is to paint the all nodes of the graph with various shades basically like that whichever pair close by (holding an arc partner them) nodes of G have 4 GRAPH COLORING IN PLANAR AND BIPARTITE appointed various hues. GRAPHS

4.1 Vertex Coloring on Bipartite Graphs :- Vertex coloring on bipartite graph is to paint the all nodes of the graph with various shades of colors like blue, green, red, orange, pink,… basically like that whichever pair close by (holding an arc partner them) nodes of G have appointed various hues.

4.4 Edge Coloring on Planar Graphs:- The edge shading of a graph G = (V, E) is which doles out a shading to each arc , fulfilling the rule that no pair of arcs distributes a typical node have a similar shading .

[7] Preethi Guptha and Omprakash Sikhwa, A study of vertex- edge coloring techniques with applications, International journal of Core Engineering & Management, 1(2) (2014), 27-32. [8]A. Muneera, Study of Graph Coloring – Its Types and Applications, Mathematical Sciences International Research Journal , Vol 5 spl Issue(2016). [9] V.A. Aksenov, On continuation of 3- coloring of planar graphs, diskret. Anal. Novosibirsk 26 (1974)3 – 19 ( in Russian). [10] Dr. Natarajan Meghanathan, Review of Graph Theory

Algorithms, Department of Computer Science, Jackson 5 APPLICATIONS State University, Jackson, MS 39217. The graph coloring problem has huge number of applications : 1. Making Time Table or Schedule :- Graph shading was utilized to make the undergraduate daily program in an regular academy office . Various restrictions in daily scheduling for instance , speechmaker requests , course hours and lab assignments were stood up to and daily time tables were delivered for undergraduates in a common period of six months . In an normal period of six months , the sequence is mandatory to be planned at various times so as to maintain a strategic distance from strife . The issue of choosing the lowest number of programmed hours are needed to list all the sequences subject to borders is a graph shading problem. 2. Aircraft Scheduling :- imagine that we have k flying machines , and we need to engage them to n machines , where the ith machine is during the time intermission (ai, bi). Visibly, on the off chance that two flights cover , at that point we cannot allot a similar airplane to the two machines. The nodes of the conflict graph compare to the machines, two nodes are linked if the matching time intermissions cover . In this manner the contention chart is an interim graph , Which can be shaded ideally in polynomial period

6 CONCLUSION Graph coloring appreciates numerous commonsense applications just as hypothetical difficulties. The fundamental point of this paper is to show the significance of different sorts of coloring. A diagram is displayed particularly to extend the uses of graph colouring in graph hypothesis

REFERENCES [1]Narsingh Deo, ― Graph theory with applications to engineering and computer science‖, Prentice Hall of India, 1990. [2] Gurmeet Singh, Manpreet Kaur, Fekete-Szegp inequality for certain Subclasses of Analytic Functions; Mathematical Sciences international Research Journal ISSN 2278 – 8697 Vol 4 Issue a (2015), Pg 108-111. [3] Discrete Mathematics and Graph Theory by Bhavanari Satyanarayana and Kuncham Syam Prasad. [4] Graph theory with Applications NARSINGH DEO. [5] Zaks. A. Alon, N-Algorithmic aspects of acyclic edge colorings. Algorithmica 32(4): 611-614, 2002. [6] Courtney L. Baber, An introduction to list colorings of graphs. Master’s Thesis Virgina polytechnic Institute and State University, Black burg, Virginia, April 2009.