Complexity of distance paired-domination problem in graphs

Gerard J. Chang, B. S. Panda, D. Pradhan. Complexity of distance paired-domination problem in graphs. Theoretical Computer Science, 459:89-99, 2012. [doi]

Abstract

Abstract is missing.