Packing Chromatic Number of Benes Network


Abstract views: 39 / PDF downloads: 30

Authors

  • S. Roy Department of Mathematics, VIT University, Vellore, India

Keywords:

Packing coloring, benes network, interconnection network

Abstract

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.

 

 

Author Biography

S. Roy, Department of Mathematics, VIT University, Vellore, India

 

 

Downloads

Published

15-05-2016

How to Cite

S. Roy. (2016). Packing Chromatic Number of Benes Network. International Journal of Mathematics And Its Applications, 4(2 - B), 151–154. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/1037

Issue

Vol. 4 No. 2 - B (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.