Browsing by Author "M, R."

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    Relation between k-DRD and dominating set
    (Springer International Publishing, 2019) Kamath, S.S.; Senthil Thilak, A.; M, R.
    In this paper, a new parameter on domination is defined by imposing a restriction on the degrees of vertices in the dominating set. For a positive integer k, a dominating set D of a graph G is said to be a k-part degree restricted dominating set (k-DRD-set), if for all u ∈ D there exists a set C u ⊆ N(u) ∩ (V − D) such that |Cu|≤⌈d(u)k⌉ and ⋃ u ∈ D C u = V − D. The minimum cardinality of a k-part degree restricted dominating set of G is called the k-part degree restricted domination number of G and is denoted by γdk(G). Here, we determine the k-part degree restricted domination number of some well-known graphs, relation between dominating and k-DRD set, and an algorithm which verifies whether a given dominating set is a k-DRD set or not. © Springer Nature Switzerland AG 2019.