|
|
| |
| On The Packing Coloring of Edge Corona Product |
Jean Claudia Joedo, Arika Indah Kristiana, Dafik, Ridho Alfarisi
|
Abstract:
All graph in this paper is connected and simple graph. Let be a distance between any vertex and in graph . A function is called a packing k-coloring if every two vertices of color are at least distance . or packing chromatic number of graph G is the smallest integer of 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.
|
|
|
| | |