Vertex coloring edge-weighting of coronation by path graphs

A. I. Kristiana, M. I. Utoyo, Dafik, I. H. Agustin, R. Alfarisi, E. Waluyo

Research output: Contribution to journalConference articlepeer-review

4 Citations (Scopus)


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, 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.

Original languageEnglish
Article number012004
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 7 May 2019
Event2nd International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2018 - Jember, East Java, Indonesia
Duration: 24 Nov 201825 Nov 2018


Dive into the research topics of 'Vertex coloring edge-weighting of coronation by path graphs'. Together they form a unique fingerprint.

Cite this