Distance-2 Independent Domination Numbers

Abstract

Abstract. The distance ) , ( v u d between two vertices u and v in a graph G equals the length of a shortest path from u to v. A distance-2 independent set of a graph G is a subset I of the vertices such that the distance between any two vertices of I in G is at least three. A set S of vertices is called a distance-2 dominating set if every vertex in S