1. DSpace at
  2. Research Publications
  3. Year-2017
Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/869
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPandey, A.-
dc.contributor.authorPanda, B.S.-
dc.date.accessioned2017-12-21T09:31:48Z-
dc.date.available2017-12-21T09:31:48Z-
dc.date.issued2017-12-21-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/869-
dc.description.abstractA set D ⊆ V of a graph G = (V,E) is called a restrained dominating set of G if every vertex not in D is adjacent to a vertex in D and to a vertex in V \ D. The MINIMUM RESTRAINED DOMINATION problem is to find a restrained dominating set of minimum cardinality. The decision version of the MINIMUM RESTRAINED DOMINATION problem is known to be NP-complete for chordal graphs. In this paper, we strengthen this NP-completeness result by showing that the problem remains NP-complete for doubly chordal graphs, a subclass of chordal graphs. We also propose a polynomial time algorithm to solve the MINIMUM RESTRAINED DOMINATION problem in block graphs, a subclass of doubly chordal graphs.en_US
dc.language.isoen_USen_US
dc.subjectDominationen_US
dc.subjectRestrained dominationen_US
dc.subjectNP-completenessen_US
dc.subjectChordal graphsen_US
dc.subjectDoubly chordal graphsen_US
dc.subjectBlock graphsen_US
dc.titleRestrained domination in some subclasses of chordal graphsen_US
dc.typeArticleen_US
Appears in Collections:Year-2017

Files in This Item:
File Description SizeFormat 
Full Text.pdf55.87 kBAdobe PDFView/Open    Request a copy
Show simple item record


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