On The Packing  k-Coloring of Edge Corona Product

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	JOEDO, Jean Claudia	-
dc.contributor.author	KRISTIANA, Arika Indah	-
dc.contributor.author	DAFIK, Dafik	-
dc.contributor.author	ALFARISI, Ridho	-
dc.date.accessioned	2020-06-25T04:26:43Z	-
dc.date.available	2020-06-25T04:26:43Z	-
dc.date.issued	2019-12-01	-
dc.identifier.uri	http://repository.unej.ac.id/handle/123456789/99368	-
dc.description.abstract	All graph in this paper is connected and simple graph. Let du,v be a distance between any vertex u and v in graph G  V,E . A function c :VG1, 2,, k is called a packing k-coloring if every two vertices of color i are at least distance i 1. G  p or packing chromatic number of graph G is the smallest integer of k which has packing coloring. In this paper, we will study about packing k-coloring of graphs and determine their packing chromatic number. We have found the exact values of the packing coloring of edge corona product	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Academic and Applied Research (IJAAR), Vol. 3 Issue 12, December – 2019, Pages: 55-59	en_US
dc.subject	Packing k-Coloring	en_US
dc.subject	Packing Chromatic Number	en_US
dc.subject	Edge Corona Product	en_US
dc.title	On The Packing k-Coloring of Edge Corona Product	en_US
dc.type	Article	en_US
dc.identifier.kodeprodi	KODEPRODI0210101#Pendidikan Matematika	-
dc.identifier.nidn	NIDN0001016827	-
dc.identifier.nidn	NIDN0007119401	-
dc.identifier.nidn	NIDN0002057606	-
Appears in Collections:	LSP-Jurnal Ilmiah Dosen

Files in This Item:

File	Description	Size	Format
F. KIP_Jurnal_Arika Indah K_On The Packing k-Coloring of Edge Corona Product.pdf		286.36 kB	Adobe PDF	View/Open

DSpace JSPUI