Show simple item record

dc.contributor.authorARININGTYAS, Regina
dc.contributor.authorKRISTIANA, Arika Indah
dc.contributor.authorDAFIK, Dafik
dc.date.accessioned2020-06-25T04:30:08Z
dc.date.available2020-06-25T04:30:08Z
dc.date.issued2020-01-09
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/99369
dc.description.abstractAll graph in this paper is connected 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 vertex of color i are at least distance i 1. G  p or packing chromatics number of graph G is the smallest integer of k which has packing coloring. Unicyclic graphs are graphs that only have one cycle. This graphs is denoted by Cl , which l is the length of the unicyclic graph. 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 unicyclic graph family.en_US
dc.language.isoenen_US
dc.publisherInternational Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 1-9en_US
dc.subjectPacking k -coloringen_US
dc.subjectPacking Chromatic Numberen_US
dc.subjectunicyclic graphsen_US
dc.titleOn The Packing k-Coloring of Unicyclic Graph Familyen_US
dc.typeArticleen_US
dc.identifier.kodeprodiKODEPRODI0210101#Pendidikan Matematika
dc.identifier.nidnNIDN0002057606
dc.identifier.nidnNIDN0001016827


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record