research
∙
06/23/2023
On minimum t-claw deletion in split graphs
For t≥ 3, K_1, t is called t-claw. In minimum t-claw deletion problem ()...
share
research
∙
06/17/2023
On the Complexity of Co-secure Dominating Set Problem
A set D ⊆ V of a graph G=(V, E) is a dominating set of G if every vertex...
research
∙
11/29/2017
The Complexity of Maximum k-Order Bounded Component Set Problem
Given a graph G=(V, E) and a positive integer k, in Maximum k-Order Boun...
research
∙
11/29/2017
The Complexity of Maximum k-Order Bounded Component Set Proble
Given a graph G=(V, E) and a positive integer k, in Maximum k-Order Boun...
research
∙
11/08/2017