research
∙
12/10/2021
Complexity of Paired Domination in AT-free and Planar Graphs
For a graph G=(V,E), a subset D of vertex set V, is a dominating set of ...
share
research
∙
09/05/2021
A linear-time algorithm for semitotal domination in strongly chordal graphs
In a graph G=(V,E) with no isolated vertex, a dominating set D ⊆ V, is c...
research
∙
08/31/2020
Semipaired Domination in Some Subclasses of Chordal Graphs
A dominating set D of a graph G without isolated vertices is called semi...
research
∙
04/01/2019
