The (d,k)-independence number of a connected graph G is an important parameter for analysing performance of interconnection networks. It has been proved to be an NPC problem to determine the exact value of (d,k)-independence number of any graph for given