Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4501
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTripathi, V-
dc.contributor.authorPandey, A-
dc.contributor.authorMaheshwari, A-
dc.date.accessioned2024-05-19T10:54:54Z-
dc.date.available2024-05-19T10:54:54Z-
dc.date.issued2024-05-19-
dc.identifier.urihttp://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4501-
dc.description.abstractAbstract: In a graph, without an isolated vertex, a dominating set , is called a semitotal dominating set if for every vertex there is another vertex such that distance between and is at most two in . Given a graph without an isolated vertex, the Minimum Semitotal Domination problem is to find a minimum cardinality semitotal dominating set of . The semitotal domination number, denoted by , is the minimum cardinality of a semitotal dominating set of . It is known that the decision version of the problem remains NP-complete even when restricted to chordal graphs, chordal bipartite graphs, and planar graphs. Galby et al. (2020) proved that the problem can be solved in polynomial time for bounded MIM-width graphs, which include many well known graph classes, but left the complexity of the problem in strongly chordal graphs unresolved. Henning and Pandey (2019) also asked to resolve the complexity status of the problem in strongly chordal graphs. In this paper, we resolve the complexity of the problem in strongly chordal graphs by designing a linear-time algorithm for the problem.en_US
dc.language.isoen_USen_US
dc.subjectDominationen_US
dc.subjectTotal dominationen_US
dc.subjectSemitotal dominationen_US
dc.subjectStrongly chordal graphsen_US
dc.subjectPolynomial-time algorithmen_US
dc.titleA linear-time algorithm for semitotal domination in strongly chordal graphsen_US
dc.typeArticleen_US
Appears in Collections:Year-2023

Files in This Item:
File Description SizeFormat 
Full Text.pdf414.9 kBAdobe PDFView/Open    Request a copy


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