Equitable Coloring On Rooted Product Of Graphs

- A finite and simple graph G is said to be equitably k − colorable if its vertices can be partitioned into k − classes V 1 , V 2 , … , V k such that each V i is an independent set and ||V i | − |V j || ≤ 1 holds for every i, j . The smallest integer k for which G is equitable chromatic number of G and denoted by χ = (G) . The equitable chromatic threshold of a graph G , denoted by χ =∗ (G) , is the minimum t such that G is equitably k − colorable for all k ≥ t . This paper focuses on the equitable colorability of rooted product of graphs, in particular, exact values or upper bounds of χ = (GoH) and χ =∗ (GoH) when G and H are cycles, paths, complete graphs and complete n − partite graphs have been found.


Introduction
Let G = (V, E) be a simple connected graph with vertex set V(G) and edge set E(G).All the definitions which are not discussed in this paper one may refer [1,2].All graph consider in this paper are simple, finite and undirected.Here P m , C m , K 1,m , K k,m , K x 1 ,x 2 ,...,x r and Q r respectively denotes the path, the cycle, the star, the complete bipartite, the complete r partite and the hypercube graph on k, m, r vertices.Graph theory is one of the most interesting branches of mathematics, with wide applications in the domain of physical networks, organic molecules, ecosystems, sociological relationships, databases, or in the flow of control in a computer program.By a graph coloring, it means to assign a color to each vertex of the graph such that no two adjacent vertices have the same color.The minimum number of colors required for coloring of a graph G is called chromatic number and is denoted by χ(G).The vertices of the same color form a color class.Various types of graph coloring is there, one among them is equitable coloring.This coloring parameter was first introduced by Meyar [3] in 1973.If the set of vertices of a graph G can be partitioned into k classes V 1 , V 2 , … , V k such that each V i is an independent set and the condition||V i | − |V j || ≤ 1 holds for every pair (i, j), then G is said to be equitably kcolorable.The smallest integer k for which G is equitably k-colorable is known as the equitable chromatic number of [7][8][9][10] G and is denoted by χ = (G).It is obvious that χ(G) ≤ χ = (G).Note that χ(G) and χ = (G) can vary a lot.For example, The equitable chromatic threshold of a graph G, denoted by χ = * (G), is the minimum t such that G is equitably k − colorable for all k ≥ t.Applications of equitable coloring can be found in scheduling and timetabling.Consider, for example, a problem of constructing university timetables.As we know, we can model this problem as coloring the vertices of a graph G whose vertices correspond to classes, edges correspond to time conflicts between classes, and colors to hours.If the set of available rooms is restricted, then we may be forced to partition the vertex set into independent subsets of as near equal size as possible, since then the room usage is the highest.We can find another application of equitable coloring in transportation problems.Here, the vertices represent garbage collection routes and two such vertices are joined by an edge when the corresponding routes should not be run on the same day.The problem of assigning one of the six days of the work week to each route becomes the problem of 6-coloring of G.
In 1973, Meyer [3] formulated the following conjecture: Equitable Coloring Conjecture [3].For any connected graph G, other than a complete graph or an odd cycle, χ = (G) ≤ Δ(G).This conjecture has been verified for all graphs on six or fewer vertices.Lih and Wu [10] proved that the Equitable Coloring Conjecture is true for all bipartite graphs.Wang and Zhang [14] considered a broader class of graphs, namely r-partite graphs.They proved that Meyer's conjecture is true for complete graphs from this class.Also, the conjecture was confirmed for outerplanar graphs [12] and planar graphs with maximum degree at least 13 [13].We also have a stronger conjecture: Equitable Δ − Coloring conjecture [7].If G is a connected graph of degree Δ, other than a complete graph, an odd cycle or a complete bipartite graph K 2n+1,2n+1 for any n ≥ 1, then G is equitably Δ − Colorable.The Equitable Δ − Coloring Conjecture holds for some classes of graphs, e.g., bipartite graphs [10], outerplanar graphs with Δ ≥ 3 [12] and planar graphs with Δ ≥ 13 [13].The detailed survey of this type of coloring is found in Lih [15].
The following work makes provision for the preliminaries on equitable coloring of cartesian, weak tensor, strong tensor, corona products and follows the equitable coloring of rooted products.Using some specific properties we arrive at some exact values of equitable chromatic number and equitable chromatic threshold number.

Preliminaries
Before we go through the main results, we want several preliminary results.Definition 2.1 [11] For graphs G and H, the Cartesian product of G and H is the graph G ◻ H with vertex set V(G ◻ H) = {(x, y): x ∈ V(G), y ∈ V(H)}, and edge set E(G ◻ H) = {(x, u)(y, v): x = y with uv ∈ E(H), or xy ∈ E(G) with u = v}.Theorem 2.2 [5] If G 1 and G 2 are equitably k − colorable, then G 1 ◻ G 2 is equitably k − colorable.Theorem 2.3 [4] Let G and H be two graphs with V(G) = V(H) such that E(G) ⊆ E(H).Then χ = (G) ≤ χ = (H).Theorem 2.4 [4] [4] The strong tensor product of graphs G and H is the graph G × H with vertex set V(G) × V(H) and edge set {(x, y)(x′, y′): {x, y), (x′, y′)} ∈ E(G ◻ H) ∪ E(G × H)}.Theorem 2.7 [4] Let G 1 , G 2 be graphs with atleast one edge each.Then χ = (G 1 ⊠ G 2 ) ≥ 1 ), χ(G 2 )} + 2. Theorem 2.8 [17] The weak tensor product of graphs G and H is the graph G × H with vertex set V(G) × V(H) and edge set {(x, y)(x′, y′): xx′ ∈ E(G) and yy′ ∈ E(H)}.Theorem 2.9 [18] 2 if mn is even 3 otherwise Theorem 2.11 [16] The corona of two graphs G and H is the graph GoH formed one copy of G and |V(G)| copies of H, where the i th vertex in the i th copy of H.
Graph products are interesting and useful in many situations.For example, Sabbidussi [21] showed that any graph has the unique decomposition into prime factors under the Cartesian product.Feigenbaum and Sch affer [19] showed that the strong tensor product admits a polynomial algorithm for decomposing a given connected graph into its factors.An analogous result with respect to weak tensor product is due to Imrich [20].The complexity of many problems, also equitable coloring, that deal with very large and complicated graphs is reduced greatly if one is able to fully characterize the properties of less complicated prime factors.

Equitable coloring of rooted products
Here we discuss about the equitable coloring on the rooted product of graphs.A graph in which one vertex is fixed as a root vertex to distinguish it from other vertices is called a rooted graph.Let G be a graph with n vertices and H be a sequence of n rooted graphs H 1 , H 2 , … , H n .The rooted product graph G(H) is obtained from the graphs G, H 1 , H 2 , … , H n by identifying the root vertex of H i with the i th vertex of G [6].

Conclusion
We have found that the exact bound for the equitable chromatic number and equitable chromatic threshold number of rooted product of some fundamental structure graphs.