Packing Chromatic Number of Enhanced Hypercubes


Abstract views: 9 / PDF downloads: 3

Authors

  • Albert William Department of Mathematics, Loyola College, Chennai, India
  • Indra Rajasingh School of Advanced Sciences, VIT University, Chennai, India
  • S.Roy Department of Mathematics, Loyola College, Chennai, India

Keywords:

Packing chromatic number, Hypercube, Enhanced hypercube

Abstract

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

15-09-2014

How to Cite

Albert William, Indra Rajasingh, & S.Roy. (2014). Packing Chromatic Number of Enhanced Hypercubes. International Journal of Mathematics And Its Applications, 2(3), 1–6. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/306

Issue

Section

Research Article