• K–DISTANCE DOMINATING SETS AND K- DISTANCE DOMINATION POLYNOMIALS OF PATH Pn AND CYCLE Cn

Abstract

Let G be a simple connected graph. A set S⊆ V is a K- dominating set if each element in V-S is atmost at a distance K from an element of S.Let D_k(P_n,i) be the set of all K- dominating sets of the graph P_n, n ≥ 1 with cardinality i and ....