dc.contributor.author | KRISTIANA, Arika Indah | |
dc.contributor.author | UTOYO, Muhammad Imam | |
dc.contributor.author | DAFIK, Dafik | |
dc.contributor.author | AGUSTIN, Ika Hesti | |
dc.contributor.author | ALFARISI, Ridho | |
dc.contributor.author | WALUYO, Eko | |
dc.date.accessioned | 2020-06-25T05:25:37Z | |
dc.date.available | 2020-06-25T05:25:37Z | |
dc.date.issued | 2019-05-07 | |
dc.identifier.uri | http://repository.unej.ac.id/handle/123456789/99383 | |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012004 | en_US |
dc.subject | Vertex coloring | en_US |
dc.subject | edge-weighting | en_US |
dc.subject | coronation | en_US |
dc.subject | path graphs | en_US |
dc.title | Vertex Coloring Edge-Weighting of Coronation by Path Graphs | en_US |
dc.type | Article | en_US |
dc.identifier.kodeprodi | KODEPRODI0210101#Pendidikan Matematika | |
dc.identifier.nidn | NIDN0002057606 | |
dc.identifier.nidn | NIDN0001016827 | |
dc.identifier.nidn | NIDN0001088401 | |
dc.identifier.nidn | NIDN0007119401 | |