Vertex coloring edge-weighting of coronation by path graphs

Abstract

In this paper, we study vertex coloring edge of corona graph. A k-edge weigting of graph G is mapping . An edge-weighting w induces a vertex coloring defined by . An edge-weighting w is vertex coloring if for any edge uv. Chang, et.al denoted by (G) the minimum k for which G has a vertex-coloring k-edge-weighting. In this paper, we obtain the lower bound of of vertex coloring edge-weighting of and we study the exact value of vertex coloring edge-weighting of path corona several graph.