Relation Between k-DRD and Dominating Set

  • S. S. KamathEmail author
  • A. Senthil Thilak
  • Rashmi M
Conference paper
Part of the Trends in Mathematics book series (TM)


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 Cu ⊆ N(u) ∩ (V − D) such that \(|C_u| \leq \lceil \frac {d(u)}{k}\rceil \) and ⋃uDCu = 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 \(\gamma _{\frac {d}{k}}(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.


Dominating set; Independent dominating set;k-part degree restricted dominating set


  1. 1.
    Bondy, J.A., Murty, U.S.R.: Graph theory, Springer (2008)Google Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R. L., Stein, C.: Introduction to Algorithms. MIT Press (2009)Google Scholar
  3. 3.
    Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of domination in graphs, CRC press (1998)Google Scholar
  4. 4.
    S.S.Kamath, A. Senthil Thilak, M.Rashmi.: 2-part degree restricted domination in graphs. In: IWCAAM’16, pp. 211–221. SHANLAX (2016)Google Scholar
  5. 5.
    West, D.B.: Introduction to Graph Theory, Vol. 2. Prentice Hall (2001)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Mathematical and Computational SciencesNational Institute of Technology KarnatakaSurathkal, Srinivasnagar, MangaloreIndia

Personalised recommendations