Packing Chromatic Number of Enhanced Hypercubes
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Packing chromatic number, Hypercube, Enhanced hypercubeAbstract
The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $\pi:V(G)\longrightarrow \{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 enhanced hypercubes.
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.