Resource placement with multiple adjacency constraints in k-ary n-cubes

The problem of placing resources in a k-ary n-cube (k>2) is considered in this paper. For a given j/spl ges/1, resources are placed such that each nonresource node is adjacent to j resource nodes. We first prove that perfect j-adjacency placements are impossible in k-ary n-cubes if n>