7 citations · 20 across the 23 of their papers we have counts for
3 papers · 1 filter
Defensive Domination in Proper Interval Graphs
Tınaz Ekim, Arthur Farley, Andrzej Proskurowski +1
-defensive domination, a variant of the classical domination problem on graphs, seeks a minimum cardinality vertex set providing a surjective defense against any attack on verti…
Well-Totally-Dominated Graphs
Selim Bahadır, Tınaz Ekim, Didem Gözüpek
A subset of vertices in a graph is called a total dominating set if every vertex of the graph is adjacent to at least one vertex of this set. A total dominating set is called minim…
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes
Arman Boyacı, Tınaz Ekim, Mordechai Shalom
Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be…