Abstract

The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interesting results regarding the equitable chromatic number for the total graph of complete bigraphs , the central graph of cycles and the central graph of paths .

1. Introduction

The central graph [1, 2] of a graph is formed by adding an extra vertex on each edge of , and then joining each pair of vertices of the original graph which were previously nonadjacent.

The total graph [3, 4] of has vertex set and edges joining all elements of this vertex set which are adjacent or incident in .

If the set of vertices of a graph can be partitioned into classes such that each is an independent set and the condition holds for every pair (), then is said to be equitably k-colorable. The smallest integer for which is equitable -colorable is known as the equitable chromatic number [510] of and denoted by . Additional graph theory terminology used in this paper can be found in [3, 4].

2. Equitable Coloring on Total Graph of Complete Bigraphs

Theorem 2.1. If , the equitable chromatic number of total graph of complete bigraphs ,

Proof. Let be the bipartition of , where and . Let be the edges of . By the definition of total graph, has the vertex set and the vertices induce disjoint cliques of order in . Also is adjacent to .Case 1 (if , ). Now we partition the vertex set as follows: Clearly are independent sets and satisfying the condition , for any , . Since there exists a clique of order in . , also each of receives one color different from the color class assigned to the clique induced by . By the definition of total graph, each is adjacent with . Therefore, and are independent sets and hence . That is, ; therefore . Hence .Case 2 (if , ). Now we partition the vertex set as follows: Clearly are independent sets of . Also and satisfy the condition , for any , . Since there exists a clique of order in . , that is, , therefore . Hence .

3. Equitable Coloring on Central Graph of Cycles and Paths

Theorem 3.1. If , the equitable chromatic number of central graph of cycles ,

Proof. Let and be the vertices and edges of taken in the cyclic order. By the definition of central graph, has the vertex set , where is the vertex of subdivision of the edge and joining all the nonadjacent vertices of in .Case 1 ( is odd). We partition the vertex set as Clearly are independent sets of . Also and . The inequality holds, for any , . For each , is nonadjacent with and and hence . That is, , . Therefore, .Case 2 ( is even). Now we partition the vertex set as follows: Clearly are independent sets of . Also . The inequality holds, for any , . For each , is nonadjacent with and and hence . That is, , . Therefore, .

Remark 3.2. If , then , respectively.

Theorem 3.3. If , the equitable chromatic number of central graph of paths ,

Proof. Let and be the vertices and edges of . By the definition of central graph, has the vertex set , where is the vertex of subdivision of the edge and joining all nonadjacent vertices of in .Case 1 ( is odd). Now we partition the vertex set as follows: Clearly are independent sets of . Also and . The inequality holds, for any , . For each , is nonadjacent with and and hence . That is, , . Therefore .Case 2 ( is even). Now we partition the vertex set as follows: Clearly are independent sets of . Also and . The inequality holds for any , . For each , is nonadjacent with and and hence . That is, , . Therefore, .

Remark 3.4. If , then , respectively.