^{1}

^{2}

Center coloring Cc(G) is a kind of coloring that is to color the vertices of a graph G is such a way that if vertices have different distances from the center then they must receive different colors. Two adjacent vertices can receive the same color. In this paper we observed the behavior of the center coloring under several graph operations such as adding, removing, union, join, sequential join, Cartesian product, corona product of graphs and we get some bounds for center coloring number in these graph operations.

Graph coloring is one of the most important, well-known and studied subfields of graph theory. Center coloring [

Adding a vertex v to a connected G graph is connecting v to all the vertices of the graph [

Removing a vertex v from the connected G graph, is deleting v and all the edges connected to v vertex [

Adding an edge e to a connected G graph is connecting e with the vertex to be added [

Removing an edge e from the connected G graph, is deleting e and edge set E ( G ) − { e } [

The Union G = G 1 ∪ G 2 has V ( G ) = V ( G 1 ) ∪ V ( G 2 ) and E ( G ) = E ( G 1 ) ∪ E ( G 2 ) [

The Join G 1 + G 2 of graphs G 1 and G 2 is a graph with vertex set V ( G 1 ) ∪ V ( G 2 ) and edge set E ( G 1 ) ∪ E ( G 2 ) ∪ { u v : u ∈ V ( G 1 ) and v ∈ V ( G 2 ) } [

The Sequential Join G 1 + G 2 + ⋯ + G n of graphs G 1 , G 2 , ⋯ , G n is a graph of three or more disjoint graphs [

( G 1 + G 2 ) ∪ ( G 2 + G 3 ) ∪ ⋯ ∪ ( G n − 1 + G n ) .

Thorny graph G * is any graph that can be obtained from a parent connected graph G by attaching p i ≥ 0 new vertices of degree one to each vertex i, is called thorny graph [

The Cartesian Product G × H of graphs G and H has the vertex set V ( G × H ) = V ( G ) × V ( H ) and (a, x) (b, y) is an edge of G × H if a = b and x y ∈ E ( H ) , or a b ∈ E ( H ) and x = y [

The Corona Product G o H is defined as the graph obtained from G and H by taking one copy of G and V(G) copies of H and then joining by an edge each vertex of the ith copy of H is named (H, i) with the ith vertex of G [

Some graphs G have the property that each vertex of G is a central vertex. A graph is self-centered if every vertex is in the center.

Theorem 1.1: If the graph G is a self-centered graph then C c = 1 [

While finding center coloring number of any graph, if the center of a graph consists more than one vertex, these vertices are contracted. So after the vertices are contracted, the center of a graph consists a single vertex.

Several results on center coloring number are surveyed and compared with the graph operations.

We refer to the book [

In this part of the study, the number of center coloring in new graphs formed as a result of applying various graph operations to one graph or more than one graph was examined.

Theorem 2.1: Let G is a connected graph, if we delete a vertex v that is not a center from a graph G, then we obtain,

1 ≤ C c ( G − v ) ≤ C c ( G ) .

Proof: The communication from center to other vertices is continued because v is not a center. Just no communication with deleted vertex. When v is deleted from the graph, G can be a self-centered graph and its center coloring number is 1 from theorem 1.1.

Theorem 2.2: Let G is a connected graph, if we add a vertex v to any vertex of a graph, then we obtain,

1 ≤ C c ( G + v ) ≤ 2 .

Proof: When v is added to the graph G shown in

Theorem 2.3: Let G is a connected graph, if the deleted edge is not a bridge, we obtain,

| C c ( G ) − C c ( G − e ) | ≤ 1 .

Proof: If the deleted edge is e is one of the edges connecting the central vertices then the number of center coloring may increase by 1 if not there will be no change in the center coloring number.

Theorem 2.4: Let G 1 and G 2 are connected graphs, G = G 1 ∘ G 2 is a corona operation then we obtain,

1 ≤ C C ( G ) ≤ 2 + C C ( G 1 ) .

Proof: Theorem 1.1 verifies the lower bound. To verify the upper bound, in corona operation the copy of G 2 is connected with every vertex of G 1 by edges as shown in

Theorem 2.5: Let G ∗ is a thorny of G then we obtain C c ( P 5 ) < C c ( P 5 ∗ ) .

Proof: In thorny operation the central vertex is not changed as shown in

Theorem 2.6: Let K n and K m are complete graphs. Using the join operation we obtain,

C c ( K n + K m ) < C c ( K n ) + C c ( K m ) .

Proof: A complete graph is a self-centered graph so from theorem 1.1 its center coloring number is one. Because the join of two complete graphs are another complete graph, the center coloring number is one.

Theorem 2.7: Let G n and G m are connected graphs. Using the join operation we obtain

C c ( G n + G m ) ≤ C c ( G n ) + C c ( G m ) .

Proof: The distance from the center to the vertices is reduced or maintained therefore the distance is reduced between every vertices of G n is connected with every vertex of G m in the join of graph G n and G m .

Theorem 2.8: For G 1 + G 2 + ⋯ + G n graphs with sequential join of three or more distinctive graphs such as G 1 , G 2 , ⋯ , G n weobtain,

C c ( G 1 + G 2 + ⋯ + G n ) ≤ C c ( G 1 ) + C c ( G 2 ) + ⋯ + C c ( G n ) .

Proof: The distance from the center of the graph formed as a result of the series sum of G 1 , G 2 , ⋯ , G n graphs to all other vertices is at most one, or the newly formed graph becomes self-centered graph. In this case, the center coloring number of this sum will be smaller than the sum of the individual center coloring number.

Theorem 2.9: Consisting of the product of two self-centered graphs the center coloring number is one.

Proof: It is a self-centered graph in the product of two self-centered graphs [

Theorem 2.10: P n is a path with n-vertices and P m is a path with m-vertices. The center coloring number of Cartesian product of P n × P m is

C c ( P n × P m ) = ⌈ n 2 − 2 n − 2 m + 9 2 ⌉ .

Proof: The graph P n × P m has n.m vertices. If n.m is “odd number” its center is a single vertex. n.m vertices are degree of 2, 3 and 4. ( n − 2 ) ( m − 2 ) of these vertices are 4 degrees. One of the 4 degree vertices is the central vertex. Half of the remaining vertices are ( n − 2 ) ( m − 2 ) − 1 2 distances from the center. The distance of 3 degree vertices to the center are 1 more than 4-degree vertices and 2-degree vertices are 1 more than 3-degree vertices. And also one color is needed for central vertex.

So

C c ( P n × P m ) = ( n − 2 ) ( m − 2 ) − 1 2 + 3 = n 2 − 2 n − 2 m + 9 2 (1)

If n.m is even number, the graph has 2-center vertices and

C c ( P n × P m ) = ⌈ n 2 − 2 n − 2 m + 9 2 ⌉ (2)

From (1) and (2) C c ( P n × P m ) = ⌈ n 2 − 2 n − 2 m + 9 2 ⌉ .

Theorem 2.11: Let G n and G m are connected graphs. Using the Cartesian product we obtain,

C c ( K n × K m ) ≤ C c ( G n × G m ) ≤ C c ( P n × P m ) .

Proof: To verify the lower bound, it is clear by theorem 2.9. Because, if G n × G m is a self-centered graph, its center coloring number is 1. So C c ( G n × G m ) is at least 1.

To verify the upper bound, the center coloring number of paths is more than well-known classes of graphs. The upper limit is the product of at least two path graphs, as the graph of the product of two path graphs grows.

In this paper, we have studied the center coloring number of different graph operations and apply our results to find bounds of some common graph families’ operations. However, there are still many other graph operations and special classes of graphs which are not covered here. So, for further research, center coloring of various other graph operations and composite graphs can be considered.

The authors declare no conflicts of interest regarding the publication of this paper.

Yorgancioglu, Z.O. and Dündar, P. (2021) Center Coloring in Graph Operations. Open Access Library Journal, 8: e7318 https://doi.org/10.4236/oalib.1107318