Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/13708
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKamath S.S.
dc.contributor.authorSenthil Thilak A.
dc.contributor.authorM R.
dc.date.accessioned2020-03-31T14:15:18Z-
dc.date.available2020-03-31T14:15:18Z-
dc.date.issued2019
dc.identifier.citationTrends in Mathematics, 2019, Vol., pp.563-572en_US
dc.identifier.uri10.1007/978-3-030-01123-9_56
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/13708-
dc.description.abstractIn 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.en_US
dc.titleRelation between k-DRD and dominating seten_US
dc.typeBook Chapteren_US
Appears in Collections:3. Book Chapters

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.