Packing Chromatic Number of Benes Network
Abstract views: 15 / PDF downloads: 14
Keywords:
Packing coloring, benes network, interconnection networkAbstract
The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $f:V(G)\longrightarrow \{1,2,...,k\}$ such that any two vertices of color $i$ are at distance at least $i+1$. In this paper, the packing chromatic number of benes network is obtained.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Mathematics And its Applications
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.