| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902792 | AKCE International Journal of Graphs and Combinatorics | 2017 | 7 Pages |
Abstract
The packing chromatic number ÏÏ(G) of a graph G is the smallest integer k for which there exists a mapping Ï:V(G)â¶{1,2,â¦,k} such that any two vertices of color i are at distance at least i+1. In this paper, we compute the packing chromatic number for certain fan and wheel related graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
S. Roy,