Induced H-packing k-partition of graphs

Abstract

ABSTRACT The minimum induced H-packing k-partition number is denoted by . The induced H-packing k-partition number denoted by is defined as where the minimum is taken over all H-packings of G. In this paper, we obtain the induced -packing k-partition number for trees, slim trees, split graphs, complete bipartite graphs, grids and circulant graphs. We also deal with networks having perfect -packing where is a claw on four vertices. We prove that an induced -packing k-partition problem is NP-Complete. Further we prove that the induced -packing k-partition number of is 2 for all hypercube networks with perfect -packing and prove that for all locally twisted cubes with perfect -packing.