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 w : (EG) ! f1; 2; ; kg. An edge-weighting w induces a vertex coloring Fw : V (G) ! N de ned by fw(v) = P v2e w(e). An edge-weighting w is vertex coloring if fw(u) 6= fw(v) 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 Pn H and we study the exact value of vertex coloring edge-weighting of path corona several graph.