Vertex Coloring Edge-Weighting of Coronation by Path Graphs

Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/99383

Title:	Vertex Coloring Edge-Weighting of Coronation by Path Graphs
Authors:	KRISTIANA, Arika Indah UTOYO, Muhammad Imam DAFIK, Dafik AGUSTIN, Ika Hesti ALFARISI, Ridho WALUYO, Eko
Keywords:	Vertex coloring edge-weighting coronation path graphs
Issue Date:	7-May-2019
Publisher:	IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012004
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.
URI:	http://repository.unej.ac.id/handle/123456789/99383
Appears in Collections:	LSP-Jurnal Ilmiah Dosen

Files in This Item:

File	Description	Size	Format
F. KIP_Jurnal_Arika Indah K_Vertex coloring edge-weighting of coronation.pdf		691.64 kB	Adobe PDF	View/Open

DSpace JSPUI