2 citations · 2 across the 5 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-indumatched Trees and Graphs of Bounded Girth
S. Akbari, T. Ekim, A. H. Ghodrati +1
A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time…
Generation of random chordal graphs using subtrees of a tree
Oylum Şeker, Pinar Heggernes, Tınaz Ekim +1
Chordal graphs form one of the most studied graph classes. Several graph problems that are NP-hard in general become solvable in polynomial time on chordal graphs, whereas many oth…