• 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 ....
Keywords
Path, Cycle, K- dominating set, K-domination polynomial.
Full Text:
pdfThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |