research
∙
03/03/2023
Complexity of total dominator coloring in graphs
Let G=(V,E) be a graph with no isolated vertices. A vertex v totally dom...
share
research
∙
02/25/2023
Cosecure Domination: Hardness Results and Algorithm
For a simple graph G=(V,E) without any isolated vertex, a cosecure domin...
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 ...
research
∙
12/04/2021
Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes
For a given graph G, a maximum internal spanning tree of G is a spanning...
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
Complexity and Algorithms for Semipaired Domination in Graphs
For a graph G=(V,E) with no isolated vertices, a set D⊆ V is called a se...
research
∙
11/29/2017
