Please use this identifier to cite or link to this item:
https://repository.unej.ac.id/xmlui/handle/123456789/99368
Title: | On The Packing k-Coloring of Edge Corona Product |
Authors: | JOEDO, Jean Claudia KRISTIANA, Arika Indah DAFIK, Dafik ALFARISI, Ridho |
Keywords: | Packing k-Coloring Packing Chromatic Number Edge Corona Product |
Issue Date: | 1-Dec-2019 |
Publisher: | International Journal of Academic and Applied Research (IJAAR), Vol. 3 Issue 12, December – 2019, Pages: 55-59 |
Abstract: | All graph in this paper is connected and simple graph. Let du,v be a distance between any vertex u and v in graph G V,E . A function c :VG1, 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 |
URI: | http://repository.unej.ac.id/handle/123456789/99368 |
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 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.