Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/99383
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKRISTIANA, Arika Indah-
dc.contributor.authorUTOYO, Muhammad Imam-
dc.contributor.authorDAFIK, Dafik-
dc.contributor.authorAGUSTIN, Ika Hesti-
dc.contributor.authorALFARISI, Ridho-
dc.contributor.authorWALUYO, Eko-
dc.date.accessioned2020-06-25T05:25:37Z-
dc.date.available2020-06-25T05:25:37Z-
dc.date.issued2019-05-07-
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/99383-
dc.description.abstractIn 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.en_US
dc.language.isoenen_US
dc.publisherIOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012004en_US
dc.subjectVertex coloringen_US
dc.subjectedge-weightingen_US
dc.subjectcoronationen_US
dc.subjectpath graphsen_US
dc.titleVertex Coloring Edge-Weighting of Coronation by Path Graphsen_US
dc.typeArticleen_US
dc.identifier.kodeprodiKODEPRODI0210101#Pendidikan Matematika-
dc.identifier.nidnNIDN0002057606-
dc.identifier.nidnNIDN0001016827-
dc.identifier.nidnNIDN0001088401-
dc.identifier.nidnNIDN0007119401-
Appears in Collections:LSP-Jurnal Ilmiah Dosen

Files in This Item:
File Description SizeFormat 
F. KIP_Jurnal_Arika Indah K_Vertex coloring edge-weighting of coronation.pdf691.64 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.