Packing chromatic number of certain fan and wheel related graphs
The packing chromatic number of a graph is the smallest integer for which there exists a mapping such that any two vertices of color are at distance at least . In this paper, we compute the packing chromatic number for certain fan and wheel related graphs.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2016.11.001 |